Jay Cox wrote:
>
>
> Any referal to a paper describing the differences between HNF and WHNF
> (yes, that includes yours Simon PJ!) would be appreciated. Actually,
> I really, really want that reference to at least read that
> bit about WHNF.
I found "Functional Programming" by Field and Har
On Fri, 12 Apr 2002, Bernard James POPE wrote:
> Do you have a copy of the book: The implementation of Functional Programming
> Languages, by Simon Peyton Jones?
>
> It is sadly out of print, but most universities have copies in their libraries.
>
> It is one of the best references that I know
Jay Cox wrote:
>
> ...
> so it looks if seq reduced to head normal form, above would be
> reduced to (\x . 2+y)
seq reduces its first argument to weak head normal form, as in:
f = seq (const undefined) "good"
g = seq undefined "bad"
Main> f
"good"
(93 reductions, 148 cells)
Main> g
"
Program e
Somewhere (either Algorithms: AFA, some paper, or the haskell report) I
read that seq evaluates its first argument to head normal form. I
remember posting on this message forum or haskell-cafe that it evaluates
the first argument to weak head normal form. At the time, I thought
I was right, THEN
