I asked a similar question a while ago on the cafe http://www.haskell.org/pipermail/haskell-cafe/2009-June/thread.html#62772
On Wed, Mar 10, 2010 at 5:33 PM, TeXitoi <texi...@texitoi.eu> wrote: > After programming as an exercice the sum function, my version is > faster than the Data.List's version. Looking at the source code, > Data.List uses a foldl and not a foldl'. foldl' seems faster and > allows to use very big lists. So, why is foldl used by Data.List for > sum? > > -- > Guillaume Pinot http://www.irccyn.ec-nantes.fr/~pinot/ > > « Les grandes personnes ne comprennent jamais rien toutes seules, et > c'est fatigant, pour les enfants, de toujours leur donner des > explications... » -- Antoine de Saint-Exupéry, Le Petit Prince > > () ASCII ribbon campaign -- Against HTML e-mail > /\ http://www.asciiribbon.org -- Against proprietary attachments > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > -- keithsheppard.name _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
