Beta-normal form Created 2026-09-28 Updated 2026-10-03
Complete development of a lambda term 2026-10-14
Curry fixed-point combinator 2026-10-14
With , the combinator satisfies . Every finite reduct of is, up to alpha equivalence, : the remaining copy of is its only beta-redex.
Normal-order beta reduction Created 2026-10-05 Updated 2026-10-14
Normal-order beta reduction contracts the leftmost outermost beta-redex. If a lambda term has a beta-normal form, this strategy reaches it. It is useful for implementing Church Boolean conditionals because an unused branch can be discarded before it is evaluated.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 76 1 Solution Created 2026-10-03 Updated 2026-10-14
Write for the reflexive closure of the transitive closure of a relation , and for its generated equivalence relation. The diamond property requires every pair to admit a one-step join . The Church-Rosser property requires a possibly longer join whenever . Equivalently, every pair of finite reductions with the same source has a common finite reduct. Identity steps may be included in the diamond convention without affecting the counterexample below.
Let and consider the lambda term . Contracting its outer beta-redex gives , whereas contracting the inner beta-redex gives . The only one-step reducts of are and ; the other branch has the sole one-step reduct . These terms are different even under alpha equivalence. Thus one-step beta reduction has no diamond property. Both branches do reach by finite beta reduction.
For the positive result, use parallel beta reduction , with rulesStructural induction, renaming binders to avoid capture, proves the substitution lemma: and imply . Define the complete development of a lambda term byand when the application is not initially a root beta-redex. Induction on a parallel derivation, using the substitution lemma in the contracting case, provesConsequently any two parallel reducts have the common successor . The ordinary one-step relation is included in the parallel relation, and every parallel step expands into finitely many ordinary steps; their finite closures therefore coincide. A finite grid of parallel diamonds joins any two finite parallel reductions. Finally a finite zigzag of forward and backward reductions can be joined inductively using that confluence. Hence beta reduction has the Church-Rosser property, although its individual steps do not have the diamond property.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 76 2 Solution Created 2026-10-03 Updated 2026-10-14
A fixed-point combinator is a closed lambda term such that for every lambda term . It suffices to check this for a fresh free variable , since capture-avoiding substitution then gives every instance. TakeIf , applying both sides to gives . Conversely suppose is a fixed-point combinator. Its application to a fresh has a head normal form, because it is beta equivalent to . Since is closed, head reduction of must first expose a lambda abstraction in itself. Thus , andThis establishes the needed abstraction equality by beta reduction, without assuming eta conversion. Abstracting now gives .
Two examples are the Curry fixed-point combinator and the Turing fixed-point combinator:Writing , we have , while . Different displayed syntax alone would not prove that the two combinators are distinct under beta equivalence. Here is a reduct invariant that does. Every finite reduct of is , up to alpha equivalence: is beta-normal and the one remaining beta-redex is its self-application. No such reduct contains the closed subterm .
Every finite reduct of , in contrast, retains a closed subterm . The contraction recreates one. The only other redexes created by these expansions are abstractions applied to variables; contracting them substitutes a variable, so preserves any closed inside their bodies. This describes all redexes inductively: expansion inserts only a variable-headed application and a copy of , and a variable substitution preserves that description. Thus every finite reduct contains . A common reduct of and is impossible, so the Church-Rosser theorem proves .
Finally put , with . The fixed-point combinator equation giveswhere is fresh. If had a head normal form with leading abstractions, then would have one with . A reduct of a head normal form preserves its initial abstraction count and variable-headed spine: only its argument subterms can still contract. These two head normal forms therefore cannot have a common reduct, contradicting the Church-Rosser theorem. Hence is unsolvable.
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 120 2 c Solution 2026-09-28
A term is in beta-normal form when it contains no beta-redex, meaning no subterm of the formEquivalently, no beta reduction can be performed anywhere in the term.
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 120 2 e Solution Created 2026-09-28 Updated 2026-10-03
No. The Omega combinator isIts only beta-redex contracts back to itself. Every reduction sequence therefore repeats the same term, which is not in beta-normal form. Thus has no beta-normal form.