A Sound and Complete Projection for Global Types.
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOriginal language
EnglishArticle number
2Pages from-to (Number of pages)
Page 14 (1 page)Journal (Volume, Issue Number)
Journal of Automated Reasoning (Volume 69, Issue 2)Publication milestones
- Published - 2025
Publication status
Published - 2025
Publication IDs
- Scopus: 105006698119
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.
Publication metrics
PlumX, opens in new tab
Mentions
1
Citations
2
Funding Details
Open access funding provided by the IT University of Copenhagen.
