Weak Head Normal Form. Section 6 de ne these normal forms. An expression is in weak head normal form (whnf), if it is either:
Weak head
And once i read through them i thought i got it. Weak head normal form means, the expression will only evaluate as far as necessary to reach to a data constructor. Therefore, every normal form expression is also in weak head normal form, though the opposite does not hold in general. Web evaluates its first argument to head normal form, and then returns its second argument as the result. So, seq forced the list to be evaluated but not the components that make. (f x) ] = false (2) whnf [ x y ] = whnf [ x ] (3) in all other cases whnf [x] = true (4) Alonzo church was alan turing’s doctoral advisor, and his lambda calculus predates turing machines. Whnf [ (\x.y) z ] = false (1) whnf [ \x. Web i have question about weak head normal form and normal form. A constructor (eventually applied to arguments) like true, just (square 42) or (:) 1.
Now, i have following expression: Web reduce terms to weak normal forms only. Web the first argument of seq is not guaranteed to be evaluated before the second argument. Web weak head normal form. Therefore, every normal form expression is also in weak head normal form, though the opposite does not hold in general. But then i read this wikipedia article where whnf is defined for the lambda calculus as follows: Section 6 de ne these normal forms. Web i have question about weak head normal form and normal form. Normal form means, the expression will be fully evaluated. A constructor (eventually applied to arguments) like true, just (square 42) or (:) 1. The evaluation of the first argument of seq will only happen when the.
