Martin-Löf Type Theory

A foundational system of constructive mathematics that unifies types, propositions, and proofs through dependent types and identity types.

Martin-Löf Type Theory

Martin-Löf Type Theory (MLTT), developed by Per Martin-Löf in the 1970s, represents a landmark achievement in the unification of mathematical logic and type theory. It serves as both a foundation for constructive mathematics and a theoretical basis for programming language theory.

Core Principles

The theory rests on several fundamental concepts:

  1. Propositions as Types - Every proposition corresponds to a type, and proofs correspond to terms of that type, implementing the curry-howard correspondence
  2. Dependent Types - Types can depend on terms, allowing for precise specifications and formal verification
  3. Identity Types - Expressing equality between terms through a type-theoretic construct
  4. Universes - Hierarchical organization of types to avoid paradoxes

Key Features

Judgments

MLTT is based on four fundamental forms of judgment:

  • A is a type
  • A and B are equal types
  • a is a term of type A
  • a and b are equal terms of type A

Type Constructors

The theory includes several basic type constructors:

  • Π-types (dependent function types)
  • Σ-types (dependent pair types)
  • Identity types
  • Natural numbers
  • Empty and unit types

Applications

MLTT has profound implications for:

  1. Foundations of Mathematics

  2. Computer Science

  3. Philosophy of Mathematics

Historical Context

Martin-Löf's work builds on earlier developments in:

Modern Developments

Recent extensions and variations include:

Impact

The theory has significantly influenced:

MLTT continues to evolve through active research, particularly in its connections to category theory and homotopy theory, forming the basis for modern developments in type-theoretic foundations of mathematics.