Curry notices formulas are types
- type theory
- logic
Haskell Curry observed in the 1930s that type schemes for combinators resemble formulas in implicational logic. A combinator’s well-typed construction could correspond to a derivation of a logical proposition. This was an early stage of the correspondence later associated with Curry and Howard. The modern account connects richer proof systems, lambda terms and normalization, developments not all present in the initial observation. The historical importance is the recognition that typing and logical provability can share a precise structure rather than merely look similar informally. **Timeline anchor:** 1 January 1934 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Curry–Howard_correspondence).
Sources
Related
On other timelines
- Functionality in Combinatory Logic connects operations and types on Tacit programming · combinators, arrays, stacks and composition by @athan
- The formulae-as-types notes are published on Type theory · foundations, languages, proof assistants and program logics by @athan