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

The Definition of Standard ML

  • languages
  • type theory

The Definition of Standard ML gave a formal account of an entire programming language, specifying static rules for typing and dynamic rules for execution. The initial definition by Milner, Tofte and Harper was followed by a later revision with additional authorship. This made language behavior a precise object of study rather than relying solely on one compiler’s behavior. Implementations could be compared against a common specification. Formal semantics does not automatically prove that every implementation is correct, but it supplies a much clearer statement of what correctness would require. **Timeline anchor:** 1 January 1990 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Standard_ML).

Sources

Related

  • ML

On other timelines

Open The Definition of Standard ML in the timeline