Session Types = Intersection Types + Union Types
نویسنده
چکیده
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the problem of computing joins and meets of session types. Also, the subtyping relation turns out to be a pre-congruence, while this is not always the case in related behavioral theories.
منابع مشابه
Intersections and Unions of Session Types
Prior work has extended the deep, logical connection between the linear sequent calculus and sessiontyped message-passing concurrent computation with equi-recursive types and a natural notion of subtyping. In this paper, we extend this further by intersection and union types in order to express multiple behavioral properties of processes in a single type. We prove session fidelity and absence o...
متن کاملCompleteness and Soundness results for X with Intersection and Union Types
This paper defines intersection and union type assignment for the sequent calculus X , a substitution-free language that enjoys the Curry-Howard correspondence with respect to Gentzen’s sequent calculus for classical logic. We show that this notion is complete (i.e. closed for subject-expansion), and show that the non-logical nature of both intersection and union types disturbs the soundness (i...
متن کاملIsomorphism of intersection and union types
This paper gives a complete characterisation of type isomorphism definable by terms of a λ-calculus in a type system with intersection and union types. Type isomorphism is usually proved using a form of Inversion Lemma to relate terms and types. Currently in the literature no inversion lemma for intersection and union types is provided. Moreover, the subject reduction property does not hold in ...
متن کاملIntersection and Union Types in the λμμ̃-calculus
The original λμe μ of Curien and Herbelin has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic. We introduce and discuss three type assignment systems that are extensions of λμe μ with intersection and union types. The intrinsic symmetry in the λμe μ calculus leads to an essential use of both intersection and union types.
متن کاملSpace Issues in Compiling with Intersection and Union Types
The CIL compiler for core Standard ML compiles whole programs using the CIL typed intermediate language with ow labels and intersection and union types. Flow labels embed ow information in the types and intersection and union types support precise polyvariant type and ow information, without the use of type-level abstraction or quanti cation. Compile-time representations of CIL types and terms ...
متن کامل