&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
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Formal Methods for Web Services
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
| Hi-index | 0.00 |
We study duality between input and output in the π-calculus. In dualisable versions of π, including πI and fusions, duality breaks with the addition of ordinary input/output types. We introduce $\overline\pi$, intuitively the minimal symmetrical conservative extension of π with input/output types. We prove some duality properties for $\overline\pi$ and we study embeddings between $\overline\pi$ and π in both directions. As an example of application of the dualities, we exploit the dualities of $\overline\pi$ and its theory to relate two encodings of call-by-name λ-calculus, by Milner and by van Bakel and Vigliotti, syntactically quite different from each other.