Beta normal form

In the lambda calculus, a term is in beta normal form if no "beta reduction" is possible. A term is in beta-eta normal form if neither a beta reduction nor an "eta reduction" is possible. A term is in head normal form if there is no "beta-redex in head position".

Beta reduction

In the lambda calculus, a beta redex is a term of the form

:$((mathbf\{lambda\}\; x\; .\; A(x))\; t)$

where $A(x)$ is a term (possibly) involving variable $x$.

A "beta reduction" is an application of the following rewrite rule to a beta redex

:$((mathbf\{lambda\}\; x\; .\; A(x))\; t)\; ightarrow\; A(t)$

where $A(t)$ is the result of substituting the term $t$ for the variable $x$ in the term $A(x)$.

A beta reduction is in head position if it is of the following form:

* $lambda\; x\_0\; ldots\; lambda\; x\_\{i-1\}\; .\; (lambda\; x\_i\; .\; A(x\_i))\; M\_1\; M\_2\; ldots\; M\_n\; ightarrow\; lambda\; x\_0\; ldots\; lambda\; x\_\{i-1\}\; .\; A(M\_1)\; M\_2\; ldots\; M\_n$, where $i\; geq\; 0,\; n\; geq\; 1$.

Any reduction not in this form is an internal beta reduction.

Reduction strategies

In general, there can be several different beta reductions possible for a given term. Normal-order reduction is the evaluation strategy in which one continually applies the rule for "beta reduction in head position" until no more such reductions are possible. At that point, the resulting term is in "head normal form".

In contrast, in applicative order reduction, one applies the internal reductions first, and then only applies the head reduction when no more internal reductions are possible.

Normal-order reduction is complete, in the sense that if a term has a head normal form, then normal order reduction will eventually reach it. In contrast, applicative order reduction may not terminate, even when the term has a normal form. For example, using applicative order reduction, the following sequence of reductions is possible:

:$(mathbf\{lambda\}\; x\; .\; z)\; ((lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w))$:$ightarrow\; (lambda\; x\; .\; z)\; ((lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w))$:$ightarrow\; (lambda\; x\; .\; z)\; ((lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w))$:$ightarrow\; (lambda\; x\; .\; z)\; ((lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w))$:$ldots$

But using normal-order reduction, the same starting point reduces quickly to normal form:

:$(mathbf\{lambda\}\; x\; .\; z)\; ((lambda\; w.\; w\; w\; w)\; (lambda\; w.\; w\; w\; w))$:$ightarrow\; z$

ee also

* Lambda calculus
* Normal form