Fair subtyping for multi-party session types
From MaRDI portal
Publication:5741567
DOI10.1017/S096012951400022XzbMATH Open1361.68172MaRDI QIDQ5741567FDOQ5741567
Authors: Luca Padovani 
Publication date: 28 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- CONFLICTS AND FAIR TESTING
- Fundamental properties of infinite trees
- Termination, deadlock, and divergence
- Subtyping for session types in the pi calculus
- Semantic subtyping for the pi-calculus
- Session types as intuitionistic linear propositions
- Fair testing
- Relating fair testing and accordance for service replaceability
- A theory of contracts for strong service compliance
- Fair subtyping for open session types
- On projecting processes into session types
Cited In (14)
- Probabilistic Analysis of Binary Sessions
- Fair subtyping for open session types
- Fair termination of multiparty sessions
- An algebraic theory for web service contracts
- Subtyping Supports Safe Session Substitution
- Fair refinement for asynchronous session types
- Precise subtyping for synchronous multiparty sessions
- A fixed-points based framework for compliance of behavioural contracts
- A logical account of subtyping for session types
- Fair asynchronous session subtyping
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- A gentle introduction to multiparty asynchronous session types
- Polarized Substructural Session Types
- Title not available (Why is that?)
This page was built for publication: Fair subtyping for multi-party session types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741567)
