Fair asynchronous session subtyping equals the largest coinductive asynchronous subtyping relation contained in the inductive convergence relation, for session types that can always terminate.
Consider the transition sequence [S,ϵ ]|[T,ϵ ]→∗ [S′,ωS′]|[T′,ωT ′]and two types S1 and T1 s.t
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Sound and Complete Characterization of Fair Asynchronous Session Subtyping
Fair asynchronous session subtyping equals the largest coinductive asynchronous subtyping relation contained in the inductive convergence relation, for session types that can always terminate.