In mathematical logic
and theoretical computer science
, a rewrite system
has the strong normalization property
(in short: the normalization property
) if every term is strongly normalizing
; that is, if every sequence of rewrites eventually terminates to a term in normal form
. A rewrite system may also have the weak normalization property
, meaning that for every term, there exists at least one particular sequence of rewrites that eventually yields a normal form.
The pure untyped lambda calculus does not satisfy the strong normalization property, and not even the weak normalization property. Consider the term . It has the following rewrite rule: For any term ,
But consider what happens when we apply to itself:
Therefore the term is not strongly normalizing.
Various systems of typed lambda calculus including the
simply typed lambda calculus, Jean-Yves Girard's System F, and Thierry Coquand's calculus of constructions are strongly normalizing.
A lambda calculus system with the normalization property can be viewed as a programming language with the property that every program terminates. Although this is a very useful property, it has a drawback: a programming language with the normalization property cannot be Turing complete. That means that there are computable functions that cannot be defined in the simply typed lambda calculus (and similarly there are computable functions that cannot be computed in the calculus of constructions or system F). As an example, it is impossible to define the normalization algorithms of any of the calculi cited above within the same calculus.