Free variables and bound variables

The distinction between variable occurrences whose values are supplied by an external assignment and occurrences captured by a quantifier, lambda or other binder within an expression.

Version

v1 · 2026-09-08 · History

Domain-specific #

4614

Origin domain

logic

Subdomain

variable binding

Core Idea

A bound variable occurrence lies within the scope of a binder for that variable, while a free occurrence is not bound in the expression and depends on external interpretation. Parsing establishes binder scope; substitution supplies free values while alpha-renaming and capture-avoidance preserve which occurrences a binder controls. 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 logic. It is scope-sensitive dependency distinction underlying open versus closed expressions. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

Scope of Application

Free variables and bound variables belongs to logic and is useful where the analyst can specify a formal expression, variable occurrences, binders and their scope, an environment or assignment, substitution, alpha-renaming and capture avoidance, then evaluate binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone. The scope is broad within that domain but bounded by the need for binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone. 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 binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone 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 Free variables and bound variables 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 Free variables and bound variables. Free variables and bound variables 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

1. Identify the carrier. State what the elements, states, objects, or observations are: a formal expression, variable occurrences, binders and their scope, an environment or assignment, substitution, alpha-renaming and capture avoidance. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of logic because they reuse a formal expression, variable occurrences, binders and their scope, an environment or assignment, substitution, alpha-renaming and capture avoidance, Parsing establishes binder scope; substitution supplies free values while alpha-renaming and capture-avoidance preserve which occurrences a binder controls., and type the carrier, state every parameter and convention in the definition, test that binding is determined occurrence by occurrence from syntactic scope, not from the variable's printed name alone, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Free variables and bound variables Domain-specific

Parents (1) — more general patterns this builds on

• Free variables and bound variables is a kind of Context Prime

  The proposed strict upward parent is prime:context.

Hierarchy path (1) — routes to 1 parentless root

• Free variables and bound variables → Context

Neighborhood in Abstraction Space

Free variables and bound variables sits in a crowded region of the domain-specific corpus (40^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Syntax, Rewriting & Declarative Form (41 abstractions)

Nearest neighbors

• Operator (linguistics) — 0.91
• Non-local variable — 0.89
• Universal quantification — 0.89
• Set-builder notation — 0.89
• Common operator notation — 0.89

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