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

Backus's Turing Award lecture

  • languages
  • people

John Backus’s Turing Award lecture, delivered in 1977 and published in 1978, criticized programming organized around the repeated modification of machine state. He proposed a functional style built through combining forms and algebraic relationships among programs. The lecture’s FP language was a particular proposal, distinct from every language now called functional. Its influence lies in making program composition and equational reasoning central to a prominent discussion of language design. The argument challenged a dominant style without proving that all stateful programming or all von Neumann hardware should disappear. **Timeline anchor:** 1 October 1977 CE. Delivered October 1977; published August 1978. **References:** [Source 1](https://en.wikipedia.org/wiki/John_Backus).

Sources

On other timelines

Open Backus's Turing Award lecture in the timeline