Girard's System F
- type theory
- lambda calculus
Jean-Yves Girard developed System F in his early-1970s work on logic and polymorphism. The calculus permits abstraction over types, making it possible to express functions that operate uniformly across many instantiations. Strong normalization for the typed system provides an important logical property: permitted reductions terminate. This result does not transfer to an arbitrary programming language merely because it supports generics. System F became a central reference for parametric polymorphism and the relationship between typed computation and second-order reasoning. **Timeline anchor:** 1 January 1972 CE. Thesis 1972 (announced 1971). **References:** [Source 1](https://en.wikipedia.org/wiki/System_F), [Source 2](https://en.wikipedia.org/wiki/Jean-Yves_Girard).
Sources
Related
On other timelines
- Girard’s thesis develops polymorphic type theory on Type theory · foundations, languages, proof assistants and program logics by @athan