VDict - Definition of head normalisation theorem

Computing (FOLDOC) dictionary

head normalisation theorem

Jump to user comments

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.

Related search result for "head normalisation theorem"

Words contain "head normalisation theorem" in its definition in Computing (FOLDOC) dictionary:
head normalisation theorem Green's Theorem normal form Computational Adequacy Theorem four colour map theorem DeMorgan's theorem General Recursion Theorem Infinite Monkey Theorem Nyquist Theorem four colour theorem more...

Comments and discussion on the word "head normalisation theorem"