[Haskell-cafe] Is there a library that has a strict version of `sum`?

[Vanessa McHale]

Yes, that was what I was never quite clear on. What is your *actual
problem, in context*, not the problem you think you have because you
read elsewhere that foldl' is more efficient?


On 08/14/2018 01:07 PM, Bryan Richter wrote:
> On 08/14/2018 11:22 AM, Damian Nadales wrote:
>
>> Ok, so if understood the bottom line of the answers I got from
>> Vanessa and Hiromi the take away seems to be: if you're prototyping
>> then stick to the lazy version of sum, otherwise use more advanced
>> data structures (Vectors or Folds).
> Are you implying that lazy functions are only good for prototyping? Or
> is there something wrong with sum in particular?
>
> More generally, why isn't sum working for you?
>
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> To (un)subscribe, modify options or view archives go to:
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
> Only members subscribed via the mailman list are allowed to post.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20180814/d9f5caac/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 488 bytes
Desc: OpenPGP digital signature
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20180814/d9f5caac/attachment.sig>