On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
ACM Transactions on Programming Languages and Systems (TOPLAS)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Update Calculus (Extended Abstract)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2000
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
A general name binding mechanism
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
| Hi-index | 0.00 |
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 sub typing 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).