Name-Passing Calculi: From Fusions to Preorders and Types

Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
The fusion calculi are a simplification of the picalculus in which input and output are symmetric and restriction is the only binder. We highlight a major difference between these calculi and the pi-calculus from the point of view of types, proving some impossibility results for subtyping in fusion calculi. We propose a modification of fusion calculi in which the name equivalences produced by fusions are replaced by name preorders, and with a distinction between positive and negative
more » ... of names. The resulting calculus allows us to import subtype systems, and related results, from the picalculus. We examine the consequences of the modification on behavioural equivalence (e.g., context-free characterisations of barbed congruence) and expressiveness (e.g., full abstraction of the embedding of the asynchronous pi-calculus).
doi:10.1109/lics.2013.44 dblp:conf/lics/HirschkoffMS13 fatcat:5flwsbq7urccvcdcqv4kc2i37y