meaning of head normalisation theorem

1. 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. heads down [Sun] Concentrating, usually so heavily and for so long that everything outside the focus area is missed. See also hack mode and larval stage, although this mode is hardly confined to fledgling hackers. [Jargon File] head-strict A head-strict function will not necessarily evaluate every cons cell of its list argument, but whenever it does evaluate a cons cell it will also evaluate the element in the head of that cell. An example of a head-strict function is beforeZero :: [Int] -> [Int] beforeZero [] = [] beforeZero 0:xs = [] beforeZero x:xs = x : beforeZero xs which returns a list up to the first zero. This pattern of evaluation is important because it is common in functions which operate on a list of inputs. See also tail-strict, hyperstrict.

Related Words

head normalisation theorem |

Developed & Maintained By Taraprasad.com