Howard's "formulae-as-types"
- type theory
- logic
William Howard’s 1969 manuscript related natural-deduction proofs to typed lambda terms. Propositions correspond to types, proofs to terms, and proof normalization to computational reduction within the matched systems. The correspondence extended earlier observations associated with Curry, giving a precise account of why constructing a program of a type can amount to establishing a proposition. It does not identify every arbitrary program with a valid proof: the logical interpretation depends on the calculus and its restrictions. The manuscript circulated before its eventual publication. **Timeline anchor:** 1 January 1969 CE. Circulated in 1969; published in 1980. **References:** [Source 1](https://en.wikipedia.org/wiki/Curry–Howard_correspondence).
Sources
Related
On other timelines
- Howard’s formulae-as-types notes circulate on Type theory · foundations, languages, proof assistants and program logics by @athan