Strong normalization (type theory)

Layer 0 — Mathematicsin the Type Theory subtree

Tait 1967 reducibility-candidates: every well-typed term in STLC / System F / MLTT reduces to a normal form regardless of reduction order; cornerstone of consistency.

Related concepts

Explore Strong normalization (type theory) on the interactive knowledge graph →