[Haskell-cafe] forLoop + strict State monad is much faster than foldl'

[John Lato]

Yes, this link is much better, thanks. (Haven't had a chance to look at the
claims yet).
On Apr 29, 2014 12:10 PM, "Niklas Hambüchen" <mail at nh2.me> wrote:

> Look, when I serve it via a different service, the report looks all fine:
>
>
>
> https://rawgit.com/nh2/loop/master/results/bench-foldl-and-iorefs-are-slow.html
>
> I should probably switch it to hosting it via Github pages once I figure
> out how to do that comfortably.
>
> > This is a strong piece of evidence the the claims therein are
> > fundamentally wrong, confusing and misleading and wrong.
>
> Now back to the claims!
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20140429/a78c4cc7/attachment.html>