A logical account of subtyping for session types
From MaRDI portal
Publication:6615560
DOI10.1016/j.jlamp.2024.100986MaRDI QIDQ6615560
Publication date: 8 October 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contract-based discovery of Web services modulo simple orchestrators
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Multiparty session types as coherence proofs
- A type system for lock-free processes
- Subtyping for session types in the pi calculus
- Propositions as sessions
- Talking bananas: structural recursion for session types
- Subtyping Supports Safe Session Substitution
- Deadlock and lock freedom in the linear π-calculus
- Fair Subtyping for Open Session Types
- Global progress for dynamically interleaved multiparty sessions
- Linear logic propositions as session types
- Fair subtyping for multi-party session types
- Precise Subtyping for Asynchronous Multiparty Sessions
This page was built for publication: A logical account of subtyping for session types