Everything About ___
Live briefing

Everything about System F

Typed lambda calculus

System F is a typed lambda calculus that introduces, to simply typed lambda calculus, a mechanism of universal quantification over types. System F formalizes parametric polymorphism in programming languages, thus forming a theoretical basis for languages such as Haskell and ML. It was discovered independently by logician Jean-Yves Girard (1972) and computer scientist John C. Reynolds. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: System FA 5-minute orientation
  2. Skim a recent paper: Software update: The ORCA program system—Version 5.0Influential work since 2022
  3. Pick up a classic book: The Autobiography of Benjamin FranklinThe most-reprinted book on the subject
  4. Read the landmark paper: UCSF Chimera—A visualization system for exploratory research and analysisCited 45,715 times
  5. Go sideways: Lambda cubeA closely related topic
  6. Go sideways: Hindley–Milner type systemA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics