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

Schönfinkel's combinators

  • lambda calculus
  • logic

Moses Schönfinkel showed in the 1920s how bound variables could be eliminated from suitable logical expressions using a small basis of combinators. Application and fixed combinatorial rules could express behavior otherwise written through abstraction. The work supplied a foundational route to variable-free function representation and influenced Curry’s later development of combinatory logic. Its relationship to point-free programming is conceptual and historical, not a claim that every tacit language directly implements the same formal calculus. The achievement concerns expressive structure, not merely omitting names for stylistic brevity. **Timeline anchor:** 1 January 1924 CE. Year of publication (lecture 1920). **References:** [Source 1](https://en.wikipedia.org/wiki/Moses_Schönfinkel), [Source 2](https://en.wikipedia.org/wiki/Combinatory_logic).

Sources

Related

On other timelines

Open Schönfinkel's combinators in the timeline