System F
System F
1 / 102
System F, also called the
polymorphic -calculus (Girard,
1972; Reynolds, 1974) adds the
idea of type quantication to the
simply-typed lambda calculus.
2 / 102
In ML-style let
Haskell features (from module 01):
Haskell
Purity
I Laziness
I Type classes
I Monads
I
1 / 234
2 / 234
Some historical milestones:
First committee meeting 1987
(last one 1999)
David Turners SASL (1976
ML
I
I
OCaml
I
I
I
I
I
Stands for Meta Language
Originally designed as metalanguage for
LCF theorem prover
(modern successors HOL/Isabelle)
Robin Milner, 1978
Standardized (SML): 1990
Implementation:
Subject: Type inference
Type inference
Readings: Pierce, chapter 22.
1 / 96
The only explicit type annotations in
the typed lambda calculus extended
with natural numbers and Booleans
are on the variab