[Haskell-cafe] Newbie question about tuples

peterv bf3 at telenet.be
Fri Jul 13 14:00:48 EDT 2007

Yes but doesn't GHC have a good "strictness analyzer" (or how is this
called?)? I haven't looked at the generated assembly code yet (if this is at
all readable; but good C/C++ compilers *do* generate reasonably readable
assembly code)

-----Original Message-----
From: Bulat Ziganshin [mailto:bulat.ziganshin at gmail.com] 
Sent: Friday, July 13, 2007 6:43 PM
To: peterv
Cc: 'Lukas Mai'; haskell-cafe at haskell.org
Subject: Re[2]: [Haskell-cafe] Newbie question about tuples

Hello peterv,

Friday, July 13, 2007, 5:03:00 PM, you wrote:

> think the latest compilers are much better). Now when implementing
> like this in Haskell, I would guess that its laziness would allow to
> "interleave" many of the math operations, reordering them to be as optimal
> as possible, removing many intermediate results (like processing streams).

don't forget that laziness by itself makes programs an orders of
magnitude slower :)

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com

More information about the Haskell-Cafe mailing list