Partially Typed Multiparty Sessions
From MaRDI portal
Publication:6197376
DOI10.4204/eptcs.383.2arXiv2308.10653MaRDI QIDQ6197376
Mariangiola Dezani-Ciancaglini, Franco Barbanera
Publication date: 19 March 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.10653
Cites Work
- Unnamed Item
- Fundamental approaches to software engineering. 20th international conference, FASE 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017. Proceedings
- Fundamental properties of infinite trees
- Composition and decomposition of multiparty sessions
- Global types with internal delegation
- Reversible sessions with flexible choices
- Undecidability of asynchronous session subtyping
- A type system for lock-free processes
- From Communicating Machines to Graphical Choreographies
- Nested Protocols in Session Types
- On the Undecidability of Asynchronous Session Subtyping
- Multiparty Asynchronous Session Types
- A Theoretical Perspective of Coinductive Logic Programming
- Multiparty asynchronous session types
- Iterative algebras at work
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- Observational Equivalence for Multiparty Sessions
- Practical coinduction
- Fencing off go: liveness and safety for channel-based programming
- Coinductive Logic Programming
- Deconfined Global Types for Asynchronous Sessions
This page was built for publication: Partially Typed Multiparty Sessions