Intersection type discipline
{{short description|Branch of type theory}}
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 (and vice versa).
Therefore, the intersection type constructor can be used to express finite heterogeneous ad hoc polymorphism (as opposed to parametric 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 (and often exactly characterize) normalization properties of λ-terms under β-reduction.
In programming languages, such as TypeScript{{cite web |url=https://www.typescriptlang.org/docs/handbook/advanced-types.html#intersection-types |title=Intersection Types in TypeScript |accessdate=2019-08-01}} and Scala,{{cite web |url=https://www.scala-lang.org/files/archive/spec/2.12/03-types.html#compound-types |title=Compound Types in Scala |accessdate=2019-08-01}} 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 (such as normalization) 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 prominent intersection type systems (excluding the universal type) is undecidable.
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.
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 (or, lambda expressions):
:
\begin{align}
M, N & ::= x \mid (\lambda x.\!M) \mid (M\;N) && \text{ where } x \text{ ranges over term variables}\\
\end{align}
= Type language =
The type language of is inductively defined by the following grammar:
:
\begin{align}
\varphi & ::= \alpha \mid \sigma \to \varphi && \text{ where } \alpha \text{ ranges over type variables}\\
\sigma & ::= \varphi_1 \cap \cdots \cap \varphi_n && \text{ where } n \geq 1
\end{align}
The intersection type constructor () is taken modulo associativity, commutativity and idempotence.
= Typing rules =
The typing rules , , , and of are:
:
\begin{array}{cc}
\dfrac{\Gamma, x : \sigma \vdash_\text{CD} M : \varphi}{\Gamma \vdash_\text{CD} \lambda x.\!M : \sigma \to \varphi}(\to\!\!\text{I})
&\dfrac{\Gamma \vdash_\text{CD} M : \sigma \to \varphi \quad \Gamma \vdash_\text{CD} N : \sigma}{\Gamma \vdash_\text{CD} M\;N : \varphi}(\to\!\!\text{E})\\\\
\dfrac{\Gamma \vdash_\text{CD} M : \varphi_1 \quad \ldots \quad \Gamma \vdash_\text{CD} M : \varphi_n}{\Gamma \vdash_\text{CD} M : \varphi_1 \cap \cdots \cap \varphi_n}(\cap\text{I})
&\dfrac{(1 \leq i \leq n)}{\Gamma, x : \varphi_1 \cap \cdots \cap \varphi_n \vdash_\text{CD} x : \varphi_i}(\cap\text{E})
\end{array}
= 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 (akin to the empty intersection) 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 (or, lambda expressions):
:
\begin{align}
M, N & ::= x \mid (\lambda x.\!M) \mid (M\;N) && \text{ where } x \text{ ranges over term variables}\\
\end{align}
= Type language =
The type language of is inductively defined by the following grammar:
:
\begin{align}
\sigma, \tau & ::= \alpha \mid \omega \mid \sigma \to \tau \mid \sigma \cap \tau && \text{ where } \alpha \text{ ranges over type variables}
\end{align}
= Intersection type subtyping =
Intersection type subtyping is defined as the smallest preorder (reflexive and transitive relation) over intersection types satisfying the following properties:
:
\begin{align}
&\sigma \leq \omega, \quad \omega \leq \omega\to\omega, \quad \sigma \cap \tau \leq \sigma, \quad \sigma \cap \tau \leq \tau, \\
& (\sigma\to\tau_1) \cap (\sigma\to\tau_2) \leq \sigma \to \tau_1 \cap \tau_2,\\
&\text{if }\sigma \leq \tau_1 \text{ and } \sigma\leq \tau_2 \text{, then } \sigma \leq \tau_1 \cap \tau_2, \\
&\text{if } \sigma_2 \leq \sigma_1 \text{ and } \tau_1 \leq \tau_2 \text{, then } \sigma_1\to\tau_1 \leq \sigma_2\to\tau_2
\end{align}
= Typing rules =
The typing rules , , , , , and of are:
:
\begin{array}{cc}
\dfrac{\Gamma, x : \sigma \vdash_{\text{BCD}} M : \tau}{\Gamma \vdash_{\text{BCD}} \lambda x.\!M : \sigma \to \tau}(\to\!\!\text{I})
&\dfrac{\Gamma \vdash_{\text{BCD}} M : \sigma \to \tau \quad \Gamma \vdash_{\text{BCD}} N : \sigma}{\Gamma \vdash_{\text{BCD}} M\;N : \tau}(\to\!\!\text{E})\\\\
\dfrac{\Gamma \vdash_{\text{BCD}} M : \sigma \quad \Gamma \vdash_{\text{BCD}} M : \tau}{\Gamma \vdash_{\text{BCD}} M : \sigma \cap \tau}(\cap\text{I})
&\dfrac{\Gamma \vdash_{\text{BCD}} M : \sigma \quad (\sigma \leq \tau)}{\Gamma \vdash_{\text{BCD}} M : \tau}(\leq)\\\\
\dfrac{}{\Gamma, x : \sigma \vdash_{\text{BCD}} x : \sigma}(\text{A})
&\dfrac{}{\Gamma \vdash_{\text{BCD}} M : \omega}(\omega)
\end{array}
= Properties =
- Semantics: is sound and complete wrt. a filter λ-model, in which the interpretation of a λ-term coincides with the set of types that can be assigned to it.
- Subject reduction: If and , then .
- Subject expansion: If and , then .
- Characterization of strong normalization: is strongly normalizing wrt. β-reduction, if and only if is derivable without rule for some and .
- Principal pairs: If is strongly normalizing, then there exists a principal pair such that for any typing the pair can be obtained from the principal pair by means of type expansions, liftings, and substitutions.