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
- Read the overview: System FA 5-minute orientation
- Skim a recent paper: Software update: The ORCA program system—Version 5.0Influential work since 2022
- Pick up a classic book: The Autobiography of Benjamin FranklinThe most-reprinted book on the subject
- Read the landmark paper: UCSF Chimera—A visualization system for exploratory research and analysisCited 45,715 times
- Go sideways: Lambda cubeA closely related topic
- Go sideways: Hindley–Milner type systemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
UCSF Chimera—A visualization system for exploratory research and analysis
PHENIX : a comprehensive Python-based system for macromolecular structure solution
The ERA‐Interim reanalysis: configuration and performance of the data assimilation system
Numerical integration of the cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes
General atomic and molecular electronic structure system
NMRPipe: A multidimensional spectral processing system based on UNIX pipes
The 2016 World Health Organization Classification of Tumors of the Central Nervous System: a summary
An automated labeling system for subdividing the human cerebral cortex on MRI scans into gyral based regions of interest
🆕 Influential since 2022
Software update: The ORCA program system—Version 5.0
Global, regional, and national burden of disorders affecting the nervous system, 1990–2021: a systematic analysis for the Global Burden of Disease Study 2021
Robot Operating System 2: Design, architecture, and uses in the wild
CBTRUS Statistical Report: Primary Brain and Other Central Nervous System Tumors Diagnosed in the United States in 2015–2019
Software Update: The ORCA Program System—Version 6.0
📚 Books worth reading
The Autobiography of Benjamin FranklinBenjamin Franklin · 1791
Escape from FreedomErich Fromm · 1941
Fundamentals of Anatomy & PhysiologyFrederic Martini, Kathleen Welch · 1989- 📕Contract pricingUnited States. General Accounting Office · 1986
Essential System AdministrationÆleen Frisch · 1991
Feedback control of dynamic systemsGene F. Franklin · 2008
Feedback control of dynamic systemsGene F. Franklin · 1986
Sams teach yourself SQL in 10 minutesBen Forta · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Lambda cube In mathematical logic and type theory, the λ-cube (also written lambda cube) is a framework introduced by Henk Barendregt to investigate the different…
- Hindley–Milner type system A Hindley–Milner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as Damas–Milner or…
- Parametric polymorphism In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place…
- Lambda calculus In mathematical logic, the lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and…
- Lambda calculus definition The lambda calculus is a formal mathematical system consisting of constructing lambda terms and performing reduction operations on them. The definition…
- Combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell…
- SKI combinator calculus The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it…
- Curry–Howard correspondence In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs…