TY - GEN
T1 - Duality and i/o-types in the π-calculus
AU - Hirschkoff, Daniel
AU - Madiot, Jean Marie
AU - Sangiorgi, Davide
PY - 2012/10/1
Y1 - 2012/10/1
N2 - 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 π, intuitively the minimal symmetrical conservative extension of π with input/output types. We prove some duality properties for π and we study embeddings between π and π in both directions. As an example of application of the dualities, we exploit the dualities of π 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.
AB - 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 π, intuitively the minimal symmetrical conservative extension of π with input/output types. We prove some duality properties for π and we study embeddings between π and π in both directions. As an example of application of the dualities, we exploit the dualities of π 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.
U2 - 10.1007/978-3-642-32940-1_22
DO - 10.1007/978-3-642-32940-1_22
M3 - Conference contribution
AN - SCOPUS:84866685946
SN - 9783642329395
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 302
EP - 316
BT - Concurrency Theory - 23rd International Conference, CONCUR 2012, Proceedings
T2 - 23rd International Conference on Concurrency Theory, CONCUR 2012
Y2 - 4 September 2012 through 7 September 2012
ER -