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's simple theory of types

  • type theory
  • lambda calculus

Alonzo Church’s 1940 formulation of the simple theory of types combined typed function expressions with a logical system. Types restrict how expressions may be formed and applied, blocking forms of unrestricted self-application responsible for earlier foundational difficulties. The system became central to higher-order logic and to the theoretical study of typed functional languages. Simple types are less expressive than later dependent theories, but that restriction supports a clear and powerful foundation. Modern implementations add further mechanisms, so the original calculus is a reference point rather than a complete programming platform. **Timeline anchor:** 1 January 1940 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Simply_typed_lambda_calculus).

Sources

Related

On other timelines

Open Church's simple theory of types in the timeline