The Expressiveness of Session Types
summary
Shows that a higher-order session calculus and its first-order fragment are mutually encodable sublanguages with formal correctness proofs, uses a decomposition into small “tri‑process” components to represent sequencing via minimal session types, and proves full abstraction for those encodings. Presents a method to synthesize per-role routers that preserve deadlock‑freedom and supports both static typing and runtime monitors, and introduces a BI‑style spawn prefix to express contraction/weakening beyond linear logic.
AI-written summary · about