Live briefing
Everything about Simply typed lambda calculus
Formal system in mathematical logic
The simply typed lambda calculus, a form of type theory, is a typed interpretation of the lambda calculus with only one type constructor that builds function types. It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus was originally introduced by Alonzo Church in 1940 as an attempt to avoid paradoxical use of the untyped lambda calculus. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Simply typed lambda calculusA 5-minute orientation
- Skim a recent paper: On Decidable and Undecidable Extensions of Simply Typed Lambda CalculusInfluential work since 2022
- Pick up a classic book: Applications of categories in computer scienceThe most-reprinted book on the subject
- Read the landmark paper: Backpropagation in the simply typed lambda-calculus with linear negationCited 23 times
- Go sideways: Newman–Penrose formalismA closely related topic
- Go sideways: Relativistic Lagrangian mechanicsA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Backpropagation in the simply typed lambda-calculus with linear negation
A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions
Simply Typed Lambda Calculus with First-Class Environments
Functions over free algebras definable in the simply typed lambda calculus
Normalization for the Simply-Typed Lambda-Calculus in Twelf
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
Stackability in the simply-typed call-by-value lambda calculus
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
🆕 Influential since 2022
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus
Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
Visualizing Type-Checking Proofs: An Educational Web-Based System for an Extended Simply Typed Lambda Calculus
đź“š Books worth reading
Applications of categories in computer scienceLMS Durham Symposium (1991) · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Newman–Penrose formalism The Newman–Penrose (NP) formalism is a set of notation developed by Ezra T. Newman and Roger Penrose for general relativity (GR). Their notation is an…
- Relativistic Lagrangian mechanics In theoretical physics, relativistic Lagrangian mechanics is Lagrangian mechanics applied in the context of special relativity and general relativity.…
- Weyl scalar In the Newman–Penrose (NP) formalism of general relativity, Weyl scalars refer to a set of five complex scalars { Ψ 0 , Ψ 1 , Ψ 2 , Ψ 3 , Ψ 4 } {\displaystyle…
- Riemann curvature tensor In the mathematical field of differential geometry, the Riemann curvature tensor or Riemann–Christoffel tensor (after Bernhard Riemann and Elwin Bruno…
- Normalisation by evaluation In programming language semantics, normalisation by evaluation (NBE) is a method of obtaining the normal form of terms in the λ-calculus by appealing to…
- Geodesics in general relativity In general relativity, a geodesic generalizes the notion of a "straight line" to curved spacetime. Importantly, the world line of a particle free from…
- Maxwell's equations in curved spacetime In physics, Maxwell's equations in curved spacetime govern the dynamics of the electromagnetic field in curved spacetime (where the metric may deviate…
- Type IIB supergravity In supersymmetry, type IIB supergravity is the unique supergravity in ten dimensions with two supercharges of the same chirality. It was first constructed…