Intersection type discipline
In mathematical logic, the intersection type discipline is a branch of type theory encompassing type systems that use the intersection type constructor to assign multiple types to a single term.
In particular, if a term can be assigned both the type and the type, then can be assigned the intersection type .
Therefore, the intersection type constructor can be used to express finite heterogeneous ad hoc polymorphism.
For example, the λ-term can be assigned the type in most intersection type systems, assuming for the term variable both the function type and the corresponding argument type.
Prominent intersection type systems include the Coppo–Dezani type assignment system, the Barendregt-Coppo–Dezani type assignment system, and the essential intersection type assignment system.
Most strikingly, intersection type systems are closely related to normalization properties of λ-terms under β-reduction.
In programming languages, such as TypeScript and Scala, intersection types are used to express ad hoc polymorphism.
History
The intersection type discipline was pioneered by Mario Coppo, Mariangiola Dezani-Ciancaglini, Patrick Sallé, and Garrel Pottinger.The underlying motivation was to study semantic properties of the λ-calculus by means of type theory.
While the initial work by Coppo and Dezani established a type theoretic characterization of strong normalization for the λI-calculus, Pottinger extended this characterization to the λK-calculus.
In addition, Sallé contributed the notion of the universal type that can be assigned to any λ-term, thereby corresponding to the empty intersection.
Using the universal type allowed for a fine-grained analysis of head normalization, normalization, and strong normalization.
In collaboration with Henk Barendregt, a filter λ-model for an intersection type system was given, tying intersection types ever more closely to λ-calculus semantics.
Due to the correspondence with normalization, typability in infinite intersection type systems is undecidable. However restricting intersection types to finite rank makes their typeability decidable for any finite rank, which is in contrast with system F, where restrictions to finite ranks above 3 still have undecidable typeability. On the other hand, if recursive types are added to a system with rank-2 or higher intersection types, typability becomes undecidable, in general.
Complementarily, undecidability of the dual problem of type inhabitation in prominent intersection type systems was proven by Paweł Urzyczyn.
Later, this result was refined showing exponential space completeness of rank 2 intersection type inhabitation and undecidability of rank 3 intersection type inhabitation.
Remarkably, principal type inhabitation is decidable in polynomial time.
To deal with the difficulties in applying the Curry-Howard correspondence to intersection types, Kamareddine and Wells have replaced the intersection constructor in the deduction system with finite-set declarations for the domain of each variable in a lambda abstraction, turning them into Π types. And they extended the lambda cube to what they call the f-cube, which has with FSD-encoded intersection types at all vertices. Urzyczyn’s term U, which is untypable in the λ-cube, is typable in the f-cube.
Coppo–Dezani type assignment system
The Coppo–Dezani type assignment system extends the simply typed λ-calculus by allowing multiple types to be assumed for a term variable.Term language
The term language of is given by λ-terms :Type language
The type language of is inductively defined by the following grammar:The intersection type constructor is taken modulo associativity, commutativity and idempotence.
Typing rules
The typing rules,,, and of are:Properties
Typability and normalization are closely related in by the following properties:Subject reduction: If and, then.Normalization: If, then has a β-normal form.Typability of strongly normalizing λ-terms: If is strongly normalizing, then for some and.Characterization of λI-normalization: has a normal form in the λI-calculus, if and only if for some and.If the type language is extended to contain the empty intersection, i.e.,
then is closed under β-equality and is sound and complete for inference semantics.
Barendregt–Coppo–Dezani type assignment system
The Barendregt–Coppo–Dezani type assignment system extends the Coppo–Dezani type assignment system in the following three aspects:- introduces the universal type constant that can be assigned to any λ-term.
- allows the intersection type constructor to appear on the right-hand side of the arrow type constructor.
- introduces the intersection type subtyping partial order on types together with a corresponding typing rule.
Term language
The term language of is given by λ-terms :Type language
The type language of is inductively defined by the following grammar:Intersection type subtyping
Intersection type subtyping is defined as the smallest preorder over intersection types satisfying the following properties:Intersection type subtyping is decidable in quadratic time.