Simply typed lambda calculus

Layer 0 — Mathematicsin the Type Theory subtree

Church 1940 STLC: lambda terms typed by base types and arrows; strongly normalizing; isomorphic to intuitionistic propositional logic via Curry-Howard.

Related concepts

Explore Simply typed lambda calculus on the interactive knowledge graph →