x27;s broken; should it be this?
http://www.haskell.org/ghc/docs/latest/html/users_guide/release-5-04.html
(Seems like the "html" is missing.)
Jyrinx
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Aha! Gotcha. Thanks for the explanation.
I suppose that, in general, for tail recursion to work right, the
accumulator has to be evaluated strictly (as is how my code was fixed)?
Jyrinx
[EMAIL PROTECTED]
On Tue, 2002-03-12 at 09:34, Hal Daume III wrote:
> Here's the basic idea. Su
relatively new to
Haskell, and my understanding of laziness is hardly rigorous; in
general, how should I know where I need to use seq, and what I need to
use it on? Is there a paper I should read? (I've got Hudak's book, but
it does everything lazily IIRC)
Jyrinx
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
optimization I should be
aware of (I'm compiling with -O2)? Is this a flaw in GHC?
(BTW, as a beginner, I'd be glad to hear general commentary on my code
...)
Thanks!
Jyrinx
jyrinx_list at mindspring dot com
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell