Fair Termination of Asynchronous Binary Sessions
ACM Transactions on Programming Languages and Systems · 30.06.2026 · 48 (2) · 1-52
DOI: 10.1145/3803862 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, online erschienen am 12.05.2026. Verfasst von Luca Padovani und 1 weiteren Autor:innen. Die Arbeit nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: French Agence Nationale de la Recherche (ANR) project SmartCloud.
Abstract (Originalsprache)
We study a theory of asynchronous session types ensuring that well-typed processes terminate under a suitable fairness assumption. Fair termination entails starvation freedom and orphan message freedom namely that all messages, including those that are produced early taking advantage of asynchrony, are eventually consumed. The theory is based on a novel fair asynchronous subtyping relation for session types that is coarser than the existing ones. The type system is also the first of its kind that is firmly rooted in linear logic: fair asynchronous subtyping is incorporated as a natural generalization of the cut and axiom rules of linear logic and asynchronous communication is modeled through a suitable set of commuting conversions and of deep cut reductions in linear logic proofs.
Förderung
- French Agence Nationale de la Recherche (ANR) project SmartCloud
Zitieren
APA
Padovani, L., & Zavattaro, G. (2026). Fair Termination of Asynchronous Binary Sessions. ACM Transactions on Programming Languages and Systems, 48(2), 1-52. https://doi.org/10.1145/3803862
Vancouver
Padovani L, Zavattaro G. Fair Termination of Asynchronous Binary Sessions. ACM Transactions on Programming Languages and Systems. 2026;48(2):1-52. doi:10.1145/3803862
BibTeX
@article{Padovani2026,
author = {Padovani, Luca and Zavattaro, Gianluigi},
title = {Fair Termination of Asynchronous Binary Sessions},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2026},
volume = {48},
number = {2},
pages = {1--52},
doi = {10.1145/3803862}
}
EUVIMED