head normalisation theorem

from The Free On-line Dictionary of Computing (8 July 2008)
head normalisation theorem

   Under the typed lambda-calculus, beta/delta reduction of the
   left-most redex (normal order reduction) is guaranteed to
   terminate with a head normal form if one exists.  See also
   Church-Rosser theorem.
    

[email protected]