[Haskell] Laziness and the IO Monad (randomness)

[Taral]

On 3/1/07, Dave Tapley <dukedave at gmail.com> wrote:
> My question asks why this is the case, when laziness should ensure only the
> first 10 cases need to be computed.

Basically, because the IO monad is strict, not lazy. If you want
laziness, don't use the IO monad.

-- 
Taral <taralx at gmail.com>
"You can't prove anything."
    -- Gödel's Incompetence Theorem