go-v.orgcodex
Menu
Page tools

codex · Philosophy

Explicit substitution

In computer science, lambda calculi are said to have explicit substitutions if they pay special attention to the formalization of the process of substitution. This is in contrast to the standard lambda calculus where substitutions are performed by beta reductions in an implicit manner which is not expressed within the calculus; the "freshness" conditions in such implicit calculi are a notorious source of errors. The concept has appeared in a large number of published papers in quite different fields, such as in abstract machines, predicate logic, and symbolic computation.

Wikipedia contributors, "Explicit substitution", Wikipedia, revision 1381475756, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex