Fair subtyping for multi-party session types
Luca Padovani · Mathematical Structures in Computer Science · 2014
The subtyping relation defined for dyadic session type theories may compromise the liveness of multi-party sessions. In this paper, we define afairsubtyping relation for multi-party session types that preserves liveness, we relate it with the subtyping relation for dyadic session types and provide coinductive, axiomatic and algorithmic characterizations for it.