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

Gradual typing

  • type theory

Jeremy Siek and Walid Taha’s 2006 work formulated gradual typing as a way to combine statically known types with dynamically checked parts of a program. A programmer could introduce type information incrementally rather than choose only between wholly static and wholly dynamic disciplines. Research examined the meaning of boundaries, casts and guarantees when typed and untyped code interact. Later practical systems make different choices: TypeScript, for example, should not be assumed to implement every formal property of the original gradual-typing models. The concept concerns a design space, not one uniform implementation. **Timeline anchor:** 1 January 2006 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Gradual_typing).

Sources

Related

On other timelines

Open Gradual typing in the timeline