TY - JOUR
T1 - Multiparty session types as coherence proofs
AU - Carbone, Marco
AU - Montesi, Fabrizio
AU - Montesi, Fabrizio
AU - Schürmann, Carsten
AU - Yoshida, Nobuko
PY - 2017
Y1 - 2017
N2 - We propose a Curry–Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic (CLL). In this framework, propositions correspond to the local behaviour of a participant in a multiparty session type, proofs to processes, and proof normalisation to executing communications. Our key contribution is generalising duality, from CLL, to a new notion of n-ary compatibility, called coherence. Building on coherence as a principle of compositionality, we generalise the cut rule of CLL to a new rule for composing many processes communicating in a multiparty session. We prove the soundness of our model by showing the admissibility of our new rule, which entails deadlock-freedom via our correspondence.
AB - We propose a Curry–Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic (CLL). In this framework, propositions correspond to the local behaviour of a participant in a multiparty session type, proofs to processes, and proof normalisation to executing communications. Our key contribution is generalising duality, from CLL, to a new notion of n-ary compatibility, called coherence. Building on coherence as a principle of compositionality, we generalise the cut rule of CLL to a new rule for composing many processes communicating in a multiparty session. We prove the soundness of our model by showing the admissibility of our new rule, which entails deadlock-freedom via our correspondence.
U2 - 10.1007/s00236-016-0285-y
DO - 10.1007/s00236-016-0285-y
M3 - Journal article
SN - 0001-5903
VL - 54
SP - 243
EP - 269
JO - Acta Informatica
JF - Acta Informatica
IS - 3
ER -