Abstract. We give a divergence-free encoding of polyadic Local into its monadic variant. Local is a sub-calculus of asynchronous -calculus where the recipients of a channel are local to the process that has created the channel. We prove the encoding fully-abstract with respect to barbed congruence. This implies that in Local (i) polyadicity does not add extra expressive power, and (ii) when studying the theory of polyadic Local we can focus on the simpler monadic variant. Then, we show how the idea of our encoding can be adapted to name-passing calculi with non-binding input pre x, such as Chi, Fusion and F calculi.
In REF , we give an encoding of polyadic Lπ into monadic Lπ.
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FoSSaCS
Computer Science