Curry-Howard isomorphism (typed lambda)

Layer 0 — Mathematicsin the Type Theory subtree

Curry 1934 / Howard 1969: types correspond to propositions, terms to proofs, beta-reduction to proof-normalization; foundation of constructive-mathematics + dependent-type-theory programming languages.

Related concepts

Explore Curry-Howard isomorphism (typed lambda) on the interactive knowledge graph →