[Haskell-cafe] Re: help understanding lazy evaluation

2007-08-23 Thread Jon Fairbairn
Stefan O'Rear [EMAIL PROTECTED] writes: Indeed, you've caught on an important technical distinction. Lazy: Always evaluating left-outermost-first. I think most people would rather use the term normal order¨ for that; lazy means evaluating in normal order /and/ not evaluating the same

[Haskell-cafe] Re: help understanding lazy evaluation

2007-08-23 Thread apfelmus
Ronald Guida wrote: Can anyone tell me if I've got this right? Yes, you got. The let-statement you introduce that embodies the sharing of the argument n = 12 probably should be present in the first parts, too. But this doesn't really matter, the formalities of graph reduction vary with the