🤖 AI Summary
Standard session types over-rely on serialized structure, imposing redundant sequential constraints at the type level that obscure essential behavioral dependencies.
Method: We introduce *minimal session types*, which retain only intra-process sequentiality necessary for correctness while eliminating all extraneous sequencing in the type system. Based on a higher-order concurrent session π-calculus, we develop a lossless compilation framework that translates any standard session-typed process into an equivalent minimally typed one. We further establish, for the first time, a typed version of Parrow’s three-prefix decomposition theorem, enabling type erasure while preserving behavioral equivalence.
Contribution: We demonstrate that sequentiality is not intrinsic to the type layer, proposing a conceptually minimal paradigm for session typing. We prove that minimal session types are expressively complete, strongly type-safe, and guarantee behavioral equivalence—providing a simpler, more fundamental type foundation for verifying message-passing programs.
📝 Abstract
Session types are a type-based approach to the verification of message-passing programs. They specify communication structures essential to enforcing program correctness; by relying on sequencing constructs, a session type can precisely describe the intended order of communication actions through a channel. In this paper we study a fragment of session types that makes a very limited use of sequencing; we call it minimal session types. In the context of a core process calculus with sessions and higher-order concurrency, we establish two technical results. First, we prove that every process P typable with standard session types can be compiled down into a process D(P) typable with minimal session types. Second, we prove that P and D(P) are behaviorally equivalent. These results show that having sequencing in both processes and session types is convenient, but that only sequencing in processes is truly indispensable, as it can correctly codify sequencing in types. Our developments draw inspiration from work by Parrow on behavior-preserving decompositions of untyped processes using trios, i.e., processes with exactly three nested prefixes. By casting Parrow's approach in the realm of typed processes, our developments reveal a conceptually simple formulation of session types, supported by static and dynamic correctness results.
