Parametricity¶
The uniformity principle that a parametrically polymorphic program must behave relationally the same at every type instantiation because it cannot inspect the abstract type.
Core Idea¶
Parametricity derives semantic constraints and free theorems from type-polymorphic uniformity. Relational interpretation transports related inputs across arbitrary type instances, forcing outputs to remain related and ruling out type-specific behavior. 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.
The load-bearing residual is not the broad topic of programming language theory. It is type-driven uniformity theorem for polymorphic programs. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the term satisfies the relational interpretation of its polymorphic type under the declared language and effects fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.
Scope of Application¶
Parametricity belongs to programming language theory and is useful where the analyst can specify a polymorphic term with universally quantified type, all type instantiations, relations between types, relational interpretation of type constructors and the program's input-output behavior, then evaluate the term satisfies the relational interpretation of its polymorphic type under the declared language and effects. The scope is broad within that domain but bounded by the need for the term satisfies the relational interpretation of its polymorphic type under the declared language and effects. 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 term satisfies the relational interpretation of its polymorphic type under the declared language and effects 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 Parametricity 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 Parametricity. Parametricity 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: a polymorphic term with universally quantified type, all type instantiations, relations between types, relational interpretation of type constructors and the program's input-output behavior. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the term satisfies the relational interpretation of its polymorphic type under the declared language and effects independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of programming language theory because they reuse a polymorphic term with universally quantified type, all type instantiations, relations between types, relational interpretation of type constructors and the program's input-output behavior, Relational interpretation transports related inputs across arbitrary type instances, forcing outputs to remain related and ruling out type-specific behavior., and type the carrier, state every parameter and convention in the definition, test that the term satisfies the relational interpretation of its polymorphic type under the declared language and effects, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Parametricity Domain-specific
Parents (1) — more general patterns this builds on
-
Parametricity is a kind of Invariance Prime
The proposed strict upward parent is
prime:invariance.
Hierarchy path (1) — routes to 1 parentless root
- Parametricity → Invariance
Neighborhood in Abstraction Space¶
Parametricity sits in a crowded region of the domain-specific corpus (11th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Programming Languages & Runtime Types (21 abstractions)
Nearest neighbors
- Type variable — 0.94
- Type signature — 0.92
- Relational operator — 0.92
- Unit type — 0.92
- Programming language — 0.92
Computed from structural-signature embeddings · 2026-09-08