Name-passing calculi: from fusions to preorders and types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Name-passing calculi: from fusions to preorders and types


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).
Fichier principal
Vignette du fichier
concsub.pdf (148.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00904138 , version 1 (22-11-2013)



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⟩
528 View
153 Download



Gmail Facebook X LinkedIn More