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
Rust 1.0
languages
type theory
Rust 1.0 was released in 2015 as a stability milestone for a systems language using ownership and borrowing to enforce important memory-safety properties. Its type and lifetime checks regulate access to values without requiring a tracing garbage collector for ordinary memory management. The discipline is often compared with affine typing because values cannot be freely duplicated, while discarding is permitted. Unsafe code and foreign interfaces define additional trust boundaries. Rust’s guarantees do not imply that all programs terminate or satisfy every application requirement; they address particular classes of safety errors. **Timeline anchor:** 15 May 2015 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/Rust_(programming_language)).