VDict - Definition of Head Normal Form

Computing (FOLDOC) dictionary

Head Normal Form

Jump to user comments

theory, reduction (HNF) A term describing a lambdaexpression whose top level is either a variable, a data

value, a built-in function applied to too few arguments, or a

lambda abstraction whose body is not reducible. I.e. the

top level is neither a redex nor a lambda abstraction with a

reducible body.

An expression in HNF may contain redexes in argument postions

whereas a normal form may not.

Compare Weak Head Normal Form.

(2003-01-08)

Related search result for "Head Normal Form"

Words contain "Head Normal Form":
Head Normal Form Weak Head Normal Form
Words contain "Head Normal Form" in its definition in Computing (FOLDOC) dictionary:
normal form Weak Head Normal Form Head Normal Form Root Normal Form head normalisation theorem database normalisation Church-Rosser Theorem WHNF Conjunctive Normal Form Computational Adequacy Theorem more...

Comments and discussion on the word "Head Normal Form"