Deconfined Global Types for Asynchronous Sessions
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...
Saved in:
| Published in: | Logical methods in computer science Vol. 19, Issue 1 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V
01.01.2023
|
| Subjects: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1860-5974 1860-5974 |
| DOI: | 10.46298/lmcs-19(1:3)2023 |