[Haskell-cafe] Reporting a problem with binary-0.5

[Ketil Malde]

Pete Chown <1 at 234.cx> writes:

> This code attempts to create an infinite list of random numbers -- a
> technique also used by network-dns.  It turns out that this code works
> with binary-0.4.4 but not with binary-0.5.0.2.

There was a deliberate change in strictness in 0.5 making binary strict,
which apparently speeds up GHC.  I ran into the same problem, but have
no better workaround than to require binary < 0.5 in my .cabal.

-k

(I made a note about this at http://blog.malde.org/index.php/2010/05/22/snagged/)
-- 
If I haven't seen further, it is by standing in the footprints of giants