Weak Head Normal Form. Aside from a healthy mental workout, we find lambda calculus is sometimes superior: But then i read this wikipedia article where whnf is defined for the lambda calculus as follows:
Weak head
But more importantly, working through the theory from its original viewpoint exposes us to different ways of thinking. So, seq forced the list to be evaluated but not the components that make. And once i read through them i thought i got it. Normal form means, the expression will be fully evaluated. An expression in weak head normal form has been evaluated to the outermost data constructor or lambda abstraction (the head). Section 6 de ne these normal forms. Now, i have following expression: Web weak head normal form. Web there is also the notion of weak head normal form: A constructor (eventually applied to arguments) like true, just (square 42) or (:) 1.
Now, i have following expression: An expression is in weak head normal form (whnf), if it is either: Normal form means, the expression will be fully evaluated. Web weak head normal form. Web there is also the notion of weak head normal form: (f x) ] = false (2) whnf [ x y ] = whnf [ x ] (3) in all other cases whnf [x] = true (4) Reduction strategies [ edit ] Web reduce terms to weak normal forms only. Section 6 de ne these normal forms. Web weak head normal form. Web 1 there are already plenty of questions about weak head normal form etc.
