Sat, 1 Dec 2001 15:58:47 +, Jorge Adriano [EMAIL PROTECTED] pisze:
So my question is, is there anyway to force an argument to be reduced to
*normal form*?
The meaning of normal form (applied to an arbitrary Haskell type) is
not precisely defined. It depends on the type and must be
Hi, I've just started messing around with strictness. My goal now is
understanding when and how to use it.
I began with simple examples like making a strict foldl.
When trying to sum a list of 6 elements with lazy foldl I'd get a stack
space overflow, with a strict foldl I was able to sum
Then I tried:
sfibac :: IntPos - (IntPos,IntPos) -
(IntPos,IntPos) sfibac n (a,b)
| n == 0= (a,b)
| otherwise = sfibac (n-1) (b, (+b) $! a)
I'm sorry I meant:
sfibac :: IntPos - (IntPos,IntPos) -
