Session types offer a type-based approach to describing the message exchange protocols between participants in communication-based systems. Initially, they were introduced in a binary setting, specifying communication patterns between two components. With the advent of multiparty session types (MPST), the typing discipline was extended to arbitrarily many components. In MPST, communication patterns are given in terms of global types, an Alice-Bob notation that gives a global view of how components interact. A central theorem of MPST is subject reduction: a well-typed system remains well-typed after reduction. The literature contains some formulations of MPST with proofs of subject reduction that have later been shown to be incorrect. In this paper, we show that the subject reduction proof of the original formulation of MPST by Honda et al. contains some flaws. Additionally, we provide a restriction to the theory and show that, for this fragment, subject reduction does indeed hold. Finally, we use subject reduction to show that well-typed processes never go wrong. All of our proofs are mechanised using the Coq proof assistant.
@InProceedings{tirore_et_al:LIPIcs.ECOOP.2025.31, author = {Tirore, Dawit and Bengtson, Jesper and Carbone, Marco}, title = {{Multiparty Asynchronous Session Types: A Mechanised Proof of Subject Reduction}}, booktitle = {39th European Conference on Object-Oriented Programming (ECOOP 2025)}, pages = {31:1--31:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-373-7}, ISSN = {1868-8969}, year = {2025}, volume = {333}, editor = {Aldrich, Jonathan and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2025.31}, URN = {urn:nbn:de:0030-drops-233238}, doi = {10.4230/LIPIcs.ECOOP.2025.31}, annote = {Keywords: Session types, Multiparty, Mechanisation, Coq} }
Feedback for Dagstuhl Publishing