Simply typed lambda calculus¶

The term simple type is also used to refer to extensions of the simply typed lambda calculus with constructs such as products, coproducts or natural numbers (System T) or even full recursion (like PCF).

Version: v1 · 2026-09-28 · History
Domain-specific #: 12054
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Mathematical Logic, Type Theory → Mathematics

Core Idea¶

Simply typed lambda calculus is treated here as the recurring computerscienceandinformation identity summarized by this source-grounded definition: The term simple type is also used to refer to extensions of the simply typed lambda calculus with constructs such as products, coproducts or natural numbers (System T) or even full recursion (like PCF). 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.

Scope of Application¶

Syntax. In his presentation, Church used only two base types: o for "the type of propositions" and \iota for "the type of individuals".
Syntax. The Greek letter subscripts , , etc. denote type variables; the parenthesized subscripted (\alpha\beta) denotes the function type .
Syntax. Church 1940 p.58 used 'arrow or ' to denote stands for, or is an abbreviation for.
Syntax. Informally, the function type \sigma \to \tau refers to the type of functions that, given an input of type , produce an output of type .
Syntax. The term syntax, in Backus–Naur form, is variable reference, abstractions, application, or constant.

Clarity¶

A clear use of Simply typed lambda calculus names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is The term simple type is also used to refer to extensions of the simply typed lambda calculus with constructs such as products, coproducts or natural numbers (System T) or even full recursion (like PCF).

Manages Complexity¶

Simply typed lambda calculus compresses multiple computerscienceandinformation details into a stable diagnostic relation. The source shows both the central mechanism—the validity of a typing judgment is shown by providing a typing derivation, constructed using typing rules (wherein the premises above the line allow us to derive the conclusion below the line).—and the practical consequence—likewise, the operational semantics of simply typed lambda calculus can be fixed as for.

Abstract Reasoning¶

Type the carrier. Identify the computerscienceandinformation entities to which the claim applies.
State the relation. Use the source-grounded identity: The term simple type is also used to refer to extensions of the simply typed lambda calculus with constructs such as products, coproducts or natural numbers (System T) or even full recursion (like PCF).
Check operation and conditions. This has the effect that terms differing only by type annotations can nonetheless be assigned different meanings.
Demand recognition evidence.

Knowledge Transfer¶

Within the home domain. Knowledge about Simply typed lambda calculus transfers literally when a new case preserves the same carrier type, relation, and recognition test. In his presentation, Church used only two base types: o for "the type of propositions" and \iota for "the type of individuals". The Greek letter subscripts , , etc. denote type variables; the parenthesized subscripted (\alpha\beta) denotes the function type . Beyond the home domain. No canonical parent is asserted for Simply typed lambda calculus.

Relationships to Other Abstractions¶

Current abstraction Simply typed lambda calculus Domain-specific

Parents (1) — more general patterns this builds on

Simply typed lambda calculus is a kind of Formal System Prime

Simply typed lambda calculus is a domain-specific kind of formal system under the frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.

Hierarchy paths (2) — routes to 2 parentless roots

Simply typed lambda calculus → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Simply typed lambda calculus sits in a moderately populated region (44^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Type Systems & Functional Constructs (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08