Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Subtyping for session types in the pi calculus
Acta Informatica
Information and Computation
Semantic subtyping for the pi-calculus
Theoretical Computer Science
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Two notions of sub-behaviour for session-based client/server systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Fair subtyping for multi-party session types
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Coinductive Axiomatization of Recursive Type Equality and Subtyping
Fundamenta Informaticae
| Hi-index | 0.00 |
Fair subtyping is a liveness-preserving refinement relation for session types akin to (but coarser than) the well-known should-testing precongruence. The behavioral characterization of fair subtyping is challenging essentially because fair subtyping is context-sensitive: two session types may or may not be related depending on the context in which they occur, hence the traditional coinductive argument for dealing with recursive types is unsound in general. In this paper we develop complete behavioral and axiomatic characterizations of fair subtyping and we give a polynomial algorithm to decide it.