Deconfined Global Types for Asynchronous Sessions

• Published in: arXiv.org
• Main Authors: Dagnino, Francesco, Giannini, Paola, Dezani-Ciancaglini, Mariangiola
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 12.01.2023
• Subjects: Algorithms; Computer networks; Computer Science - Logic in Computer Science; Computer Science - Programming Languages
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2111.11984

Multiparty sessions with asynchronous communications and global types play an important role for the modelling of interaction protocols in distributed systems. In designing such calculi the aim is to enforce, by typing, good properties for all participants, maximising, at the same time, the accepted behaviours. Our type system improves the state-of-the-art by typing all asynchronous sessions and preserving the key properties of Subject Reduction, Session Fidelity and Progress when some well-formedness conditions are satisfied. The type system comes together with a sound and complete type inference algorithm. The well-formedness conditions are undecidable, but an algorithm checking an expressive restriction of them recovers the effectiveness of typing.