Precise Subtyping for Asynchronous Multiparty Sessions
From MaRDI portal
Publication:5886521
DOI10.1145/3565026OpenAlexW4308731338MaRDI QIDQ5886521
Nobuko Yoshida, Silvia Ghilezan, Alceste Scalas, Jovanka Pantović, Ivan Prokić
Publication date: 5 April 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13925
completenesssoundnesssubtypingsession typestyping systems\( \pi \)-calculusasynchronous multiparty session types
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantic subtyping for the pi-calculus
- Multiparty session types, beyond duality
- On the boundary between decidability and undecidability of asynchronous session subtyping
- The completeness theorem for typing lambda-terms
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Precise subtyping for synchronous multiparty sessions
- Subtyping for session types in the pi calculus
- On Global Types and Multi-Party Session
- Multiparty Session Types Meet Communicating Automata
- On the Undecidability of Asynchronous Session Subtyping
- Full Abstraction in a Subtyped pi-Calculus with Linear Types
- Introduction to Bisimulation and Coinduction
- Multiparty Asynchronous Session Types
- A theory of contracts for web services
- Multiparty asynchronous session types
- A filter lambda model and the completeness of type assignment
- Semantic subtyping
- Global Progress in Dynamically Interleaved Multiparty Sessions
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- On Communicating Finite-State Machines
- A Filter Model for Concurrent $\lambda$-Calculus
- Preciseness of Subtyping on Intersection and Union Types
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
- Automata, Languages and Programming
- A Sound Algorithm for Asynchronous Session Subtyping
