System F

For the electronic trance music artist, see Ferry Corsten.

System F, also known as the polymorphic lambda calculus or the second-order lambda calculus, is a typed lambda calculus. It was discovered independently by the logician Jean-Yves Girard and the computer scientist John C. Reynolds. System F formalizes the notion of parametric polymorphism in programming languages.

Just as the lambda calculus has variables ranging over functions, and binders for them, the second-order lambda calculus has variables ranging over types, and binders for them.

As an example, the fact that the identity function can have any type of the form A→ A would be formalized in System F as the judgement

$\vdash \Lambda\alpha. \lambda x^\alpha.x: \forall\alpha.\alpha \to \alpha$

where α is a type variable. The upper-case $Λ$ is traditionally used to used to denote type-level functions, as opposed to the lower-case $λ$ which is used for value-level functions.

Under the Curry-Howard isomorphism, System F corresponds to a second-order logic.

System F, together with even more expressive lambda calculi, can be seen as part of the lambda cube.

1 Logic and predicates
2 System F Structures
3 Use in programming languages
4 System F_ω
5 References
6 External links

Logic and predicates

The Boolean type is defined as: $\forall\alpha.\alpha \to \alpha \to \alpha$ , where α is a type variable. This produces the following two definitions for the boolean values TRUE and FALSE:

TRUE :=

Λα.λ x α λ y α . x

FALSE :=

Λα.λ x α λ y α . y

Then, with these two λ-terms, we can define some logic operators:

AND :=

λ x B o o l e a n λ y B o o l e a n .((x (B o o l e a n)) y) F A L S E

OR :=

λ x B o o l e a n λ y B o o l e a n .((x (B o o l e a n)) T R U E) y

NOT :=

λ x B o o l e a n .((x (B o o l e a n)) F A L S E) T R U E

There really is no need for a IFTHENELSE function as one can just use raw Boolean typed terms as decision functions. However, if one is requested:

IFTHENELSE :=

Λα.λ x B o o l e a n λ y α λ z α .((x (α)) y) z

will do. A predicate is a function which returns a boolean value. The most fundamental predicate is ISZERO which returns TRUE if and only if its argument is the Church numeral 0:

ISZERO := λ n. n (λ x. FALSE) TRUE

System F Structures

System F allows recursive constructions to be embedded in a natural manner, related to that in Martin-Löf's type theory. Abstract structures (S) are created using constructors. These are functions typed as:

$K_1\rightarrow K_2\rightarrow\dots\rightarrow S$ .

Recursivity is manifested when $S$ itself appears within one of the types $K i$ . If you have $m$ of these constructors, you can define the type of $S$ as:

$\forall \alpha.(K_1^1[\alpha/S]\rightarrow\dots\rightarrow \alpha)\dots\rightarrow(K_1^m[\alpha/S]\rightarrow\dots\rightarrow \alpha)\rightarrow \alpha$

For instance, the natural numbers can be defined as an inductive datatype $N$ with constructors

z e r o :N

$\mathit{succ} : \mathrm{N} \to \mathrm{N}$

The System F type corresponding to this structure is $\forall \alpha. \alpha \to (\alpha \to \alpha) \to \alpha$ . The terms of this type comprise a typed version of the Church numerals, the first few of which are:

0 := $\Lambda \alpha . \lambda x^\alpha . \lambda f^{\alpha\to\alpha} . x$

1 := $\Lambda \alpha . \lambda x^\alpha . \lambda f^{\alpha\to\alpha} . f x$

2 := $\Lambda \alpha . \lambda x^\alpha . \lambda f^{\alpha\to\alpha} . f (f x)$

3 := $\Lambda \alpha . \lambda x^\alpha . \lambda f^{\alpha\to\alpha} . f (f (f x))$

If we reverse the order of the curried arguments (i.e., $\forall \alpha. (\alpha \to \alpha) \to \alpha \to \alpha$ ), then the Church numeral for $n$ is a function that takes a function f as argument and returns the $n th$ power of f. That is to say, a Church numeral is a higher-order function -- it takes a single-argument function f, and returns another single-argument function.

Use in programming languages

The version of System F used in this article is as an explicitly-typed, or Church-style, calculus. The typing information contained in λ-terms makes type-checking straightforward. Joe Wells (1994) settled an "embarrassing open problem" by proving that type checking is undecidable for a Curry-style variant of System F, that is, one that lacks explicit typing annotations. [1] [2]

Wells' result implies that type inference for System F is impossible. A restriction of System F known as "Hindley-Milner", or simply "HM", does have an easy type inference algorithm and is used for many strongly typed functional programming languages such as Haskell 98 and ML. Over time, as the restrictions of HM-style type systems have become apparent, languages have steadily moved to more expressive logics for their type systems. As of 2008, GHC, a Haskell compiler, goes beyond HM, and now uses System F extended with non-syntactic type equality, for example.

System $F ω$

System $F 1$ is the simply-typed lambda calculus; it includes no mappings from types to types. The System F described in this article is technically System $F 2$ ; that is, the system wherein all mappings from types to types take arguments which are strictly first-order (not functions themselves).

In general, there is a family of systems defined inductively by the kinds permitted in each system:

$F 1$ does not permit any kinds (only types)
F_n permits kinds:
- $\star$ (the kind of types) and
- $J\Rightarrow K$ where $J\in F_{n-1}$ and $K\in F_n$ (the kind of functions from types to types, where the argument type is of a lower order)

In the limit, we can define system $F ω$ to be

$F_\omega = \underset{1 \leq i}{\bigcup} F_i$

That is, $F ω$ is the system which allows functions from types to types where the argument (and result) may be of any order.

Note that although $F ω$ places no restrictions on the order of the arguments in these mappings, it does restrict the universe of the arguments for these mappings -- they must be types rather than values. System $F ω$ does not permit mappings from values to types (Dependent types), though it does permit mappings from values to values ( $λ$ abstraction), mappings from types to values ( $Λ$ abstraction, sometimes written $\forall$ ) and mappings from types to types ( $λ$ abstraction at the level of types)

References

Girard, Lafont and Taylor, Proofs and Types. Cambridge University Press, 1989, ISBN 0 521 37181 3.
J. B. Wells. "Typability and type checking in the second-order lambda-calculus are equivalent and undecidable." In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 176-185, 1994. [3]

External links

Summary of System F by Franck Binard.

Categories: Lambda calculus | Type theory

Why are we here?
All text is available under the terms of the GNU Free Documentation License
This page is cache of Wikipedia. History