circagraph
Sign inSign up

Type theory and functional programming: a history

From Frege's Begriffsschrift and Russell's theory of types to the lambda calculus, Curry–Howard, ML and Haskell, dependent types and proof assistants, and functional ideas in mainstream languages. Moments are tagged (type theory, logic, lambda calculus, category theory, proof assistants, languages, compilers & implementation, effects, people) and colored by their first tag; eras are shown as spans and lines trace lineages. Dates are publication or release dates unless a note says otherwise. Summaries are our own; each moment links to its Wikipedia sources.

Duration correction: Ongoing subjects previously drawn through a present/research cutoff are represented at their original starts, with no end asserted. Existing moments at those coordinates are reused; their attached cards retain the former duration’s notes, sources, tags and media. Bounded historical and coverage intervals remain durations.

82 moments · 1879 CE – 2025 CE · by @athan · @athan

Church and Turing: computability

  • lambda calculus
  • logic

Alonzo Church used the lambda calculus and related formal work in the 1930s to investigate effective calculability. His 1936 undecidability result showed that there is no general mechanical procedure for solving the decision problem for first-order logic. Lambda calculus represents computation through abstraction and application, making substitution central to evaluation. Church’s result helped establish that limits on algorithms can be proved mathematically, rather than attributed only to inadequate hardware. Alan Turing reached a corresponding negative result through a different model. Their convergence supports the conceptual framework connecting formally defined computation with the intuitive idea of an effective procedure. **Timeline anchor:** 1 January 1936 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Church–Turing_thesis), [Source 2](https://en.wikipedia.org/wiki/Entscheidungsproblem).

Sources

Related

On other timelines

Open Church and Turing: computability in the timeline