Although this doesn't answer your question, I think it is releated. When
implementing SHA, I need to create a recursive function to append the
length of a string to the string. This function needed to be strict,
because it needed to accumulted the length of the string, and it needed to
be
Concerning the laziness support problem,
I thank people for explanations about foldl and foldr.
I wonder how to avoid these numerous cost pitfalls.
Maybe, the complier could do more optimization?
Duncan Coutts [EMAIL PROTECTED] writes
There are important differences between foldl, foldl'
Hi
I do not see foldl' in the standard library.
Is it of the GHC lib extension? has it strictness annotation?
Hoogle it!
http://haskell.org/hoogle/?q=foldl%27
Data.List.foldl' :: (a - b - a) - a - [b] - a
Thanks
Neil
___
Glasgow-haskell-users
