Subject reduction¶
The type-preservation property that evaluation of a well-typed expression cannot change or destroy its assigned type.
Core Idea¶
Subject reduction states that if Γ⊢e:τ and e reduces to e′, then Γ⊢e′:τ, usually forming type soundness together with progress or an analogous no-stuck theorem. The proof proceeds by induction on reduction, substitution, canonical forms, and typing derivations, showing each operational rule preserves the static judgment. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Subject reduction belongs to programming language metatheory and is useful where the analyst can specify the typed programming language metatheory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the syntax, typing relation, operational reduction, context discipline, substitution lemma, and exact preservation theorem are fixed and every permitted step retains the type. The scope is broad within that domain but bounded by the need for the syntax, typing relation, operational reduction, context discipline, substitution lemma, and exact preservation theorem are fixed and every permitted step retains the type. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the syntax, typing relation, operational reduction, context discipline, substitution lemma, and exact preservation theorem are fixed and every permitted step retains the type the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Subject reduction can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Subject reduction. Subject reduction compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed programming language metatheory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the syntax, typing relation, operational reduction, context discipline, substitution lemma, and exact preservation theorem are fixed and every permitted step retains the type independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of programming language metatheory because they reuse the typed programming language metatheory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The proof proceeds by induction on reduction, substitution, canonical forms, and typing derivations, showing each operational rule preserves the static judgment., and type the carrier, state every parameter and convention in the definition, test that the syntax, typing relation, operational reduction, context discipline, substitution lemma, and exact preservation theorem are fixed and every permitted step retains the type, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Subject reduction Domain-specific
Parents (1) — more general patterns this builds on
-
Subject reduction is a kind of Invariance Prime
The proposed strict upward parent is
prime:invariance.
Hierarchy path (1) — routes to 1 parentless root
- Subject reduction → Invariance
Neighborhood in Abstraction Space¶
Subject reduction sits in a crowded region of the domain-specific corpus (22nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Metalogic & Formal Foundations (13 abstractions)
Nearest neighbors
- Relational operator — 0.92
- Metatheorem — 0.92
- Programming language — 0.91
- Type signature — 0.91
- Proof-theoretic semantics — 0.91
Computed from structural-signature embeddings · 2026-09-08