[Haskell-cafe] How is laziness defined?
wagner.andrew at gmail.com
Mon Feb 5 00:13:30 EST 2007
I found it useful to work through an example where lazy evaluation was
important, and wrote it up in a tutorial. It may or may not help you,
no guarantees, but here it is:
Any comments are welcome!
On 2/4/07, TJ <tjay.dreaming at gmail.com> wrote:
> I would think that with 100% laziness, nothing would happen until the
> Haskell program needed to output data to, e.g. the console. Quite
> obviously that's not it. So how is laziness defined in Haskell?
> I remember vaguely someone saying that pattern matching on a value
> forces it to be evaluated. Is that right? What else?
> This is one of the things that just boggles my mind everytime I try to
> wrap it around this thing called Haskell ;)
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe