MAG$\pi$!: The Role of Replication in Typing Failure-Prone Communication
Matthew Alan Le Brun, Ornela Dardha

TL;DR
MAG$\pi$! extends the multiparty session types framework by integrating replication, enabling more flexible modeling of failure-prone, infinitely available communication protocols with proven safety properties.
Contribution
It introduces replication into multiparty session types, simplifying the specification of distributed client-server interactions and proving key safety properties.
Findings
Type system guarantees handling of message loss via timeouts
Replication simplifies specification of distributed interactions
Proven properties include subject reduction and session fidelity
Abstract
MAG is a Multiparty, Asynchronous and Generalised -calculus that introduces timeouts into session types as a means of reasoning about failure-prone communication. Its type system guarantees that all possible message-loss is handled by timeout branches. In this work, we argue that the previous is unnecessarily strict. We present MAG!, an extension serving as the first introduction of replication into Multiparty Session Types (MPST). Replication is a standard -calculus construct used to model infinitely available servers. We lift this construct to type-level, and show that it simplifies specification of distributed client-server interactions. We prove properties relevant to generalised MPST: subject reduction, session fidelity and process property verification.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Embedded Systems Design Techniques · Logic, programming, and type systems
