Skip to Main content Skip to Navigation
Conference papers

Name-passing calculi: from fusions to preorders and types

Daniel Hirschkoff 1, 2, 3 Jean-Marie Madiot 1, 2, 3, * Davide Sangiorgi 2, 4
* Corresponding author
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
3 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The fusion calculi are a simplification of the pi-calculus 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 occurrences of names. The resulting calculus allows us to import subtype systems, and related results, from the pi-calculus. 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).
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download
Contributor : Jean-Marie Madiot <>
Submitted on : Friday, November 22, 2013 - 10:37:56 AM
Last modification on : Friday, July 10, 2020 - 7:56:01 AM
Long-term archiving on: : Sunday, February 23, 2014 - 3:05:18 AM


Files produced by the author(s)




Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Name-passing calculi: from fusions to preorders and types. LICS - 28th Annual ACM/IEEE Symposium on Logic in Computer Science - 2013, 2013, New Orleans, United States. pp.378-387, ⟨10.1109/LICS.2013.44⟩. ⟨hal-00904138⟩



Record views


Files downloads