License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITP.2023.28
URN: urn:nbn:de:0030-drops-184039
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18403/
Tirore, Dawit ;
Bengtson, Jesper ;
Carbone, Marco
A Sound and Complete Projection for Global Types
Abstract
Multiparty session types is a typing discipline used to write specifications, known as global types, for branching and recursive message-passing systems. A necessary operation on global types is projection to abstractions of local behaviour, called local types. Typically, this is a computable partial function that given a global type and a role erases all details irrelevant to this role.
Computable projection functions in the literature are either unsound or too restrictive when dealing with recursion and branching. Recent work has taken a more general approach to projection defining it as a coinductive, but not computable, relation. Our work defines a new computable projection function that is sound and complete with respect to its coinductive counterpart and, hence, equally expressive. All results have been mechanised in the Coq proof assistant.
BibTeX - Entry
@InProceedings{tirore_et_al:LIPIcs.ITP.2023.28,
author = {Tirore, Dawit and Bengtson, Jesper and Carbone, Marco},
title = {{A Sound and Complete Projection for Global Types}},
booktitle = {14th International Conference on Interactive Theorem Proving (ITP 2023)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-284-6},
ISSN = {1868-8969},
year = {2023},
volume = {268},
editor = {Naumowicz, Adam and Thiemann, Ren\'{e}},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18403},
URN = {urn:nbn:de:0030-drops-184039},
doi = {10.4230/LIPIcs.ITP.2023.28},
annote = {Keywords: Session types, Mechanisation, Projection, Coq}
}
