Fair subtyping for multi-party session types

DOI10.1017/S096012951400022XzbMath1361.68172MaRDI QIDQ5741567

Luca Padovani

Publication date: 28 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Fair refinement for asynchronous session types ⋮ An algebraic theory for web service contracts ⋮ A fixed-points based framework for compliance of behavioural contracts ⋮ A Gentle Introduction to Multiparty Asynchronous Session Types ⋮ Probabilistic Analysis of Binary Sessions ⋮ Unnamed Item

Cites Work

• Fair testing
• Semantic subtyping for the pi-calculus
• Relating fair testing and accordance for service replaceability
• Fundamental properties of infinite trees
• Subtyping for session types in the pi calculus
• On projecting processes into session types
• Session Types as Intuitionistic Linear Propositions
• A theory of contracts for strong service compliance
• Termination, deadlock, and divergence
• Fair Subtyping for Open Session Types
• CONFLICTS AND FAIR TESTING

This page was built for publication: Fair subtyping for multi-party session types