Fair Termination of Binary Sessions
summary
Claims the first type system ensuring fair termination of binary sessions and a liveness-preserving fair subtyping relation that rejects unsafe substitutions the standard subtype allows. Uses a combined inductive/coinductive characterization of subtyping and a concrete measure pairing a rank bound on casts with an effort metric; proves subject reduction and soundness (well typed implies fair termination). Implements a checker, formalizes proofs in the supplementary artifacts, and the implementation is available and evaluated.
AI-written summary · about
chapters (6)
- 0:00Fair termination of binary sessions
- 2:39Fair termination assumptions
- 7:16Fair subtyping for liveness
- 13:08Soundness proof
- 16:41Higher-order session types
- 19:27Question and answer session
related talks
23mPrecise Subtyping for Asynchronous Multiparty Sessions
31mTermination in Concurrency, Revisited
21mA Semantic Logical Relation for Termination of Intuitionistic Linear Logic Session Types
20mDegrees of Separation: A Flexible Type System for Safe Concurrency
26mDegrees of Separation: A Flexible Type System for Data Race Prevention
14mMaking Weak Memory Models Fair
50mSession Types Meet Polymorphism and Dependent Types
23mProbabilistic Refinement Session Types
