Martin-Löf type theory
- type theory
- proof assistants
Per Martin-Löf developed intuitionistic type theory in the early 1970s as a foundation connecting constructive mathematics with computation. Dependent types express propositions and families of mathematical objects whose form can vary with values. The theory evolved through revisions, including careful treatment of universes after problems with an early unrestricted formulation. Its significance includes an interpretation of proofs as constructions and the computational behavior of those constructions. Later proof assistants and languages adopt different versions and extensions, rather than one universally identical “Martin-Löf system.” **Timeline anchor:** 1 January 1972 CE. Predicative version 1972; further versions 1979 and 1984. **References:** [Source 1](https://en.wikipedia.org/wiki/Intuitionistic_type_theory), [Source 2](https://en.wikipedia.org/wiki/Per_Martin-Löf).
Sources
Related
On other timelines
- Martin-Löf’s early type theory uses a type of all types on Type theory · foundations, languages, proof assistants and program logics by @athan