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

[David Thomas]

Maybe some means of asserting that a rule is applied?  Hopefully by
effect (this list should not appear in the core, or whatnot) rather
than by naming the particular rule...

On Wed, Apr 30, 2014 at 7:34 AM, Joachim Breitner
<mail at joachim-breitner.de> wrote:
> Hi,
>
> Am Mittwoch, den 30.04.2014, 15:13 +0100 schrieb Niklas Hambüchen:
>> For performance-critical code, it seems sensible for me to stick to my
>> `forLoop` for now, as it works quite well with the existing GHCs and
>> much less brain seems to be necessary to get that compile down to fast
>> code.
>
> I agree. I think one big problem is that RULES (e.g. list fusion) are
> great when they work, but it is very hard for the “normal” Haskell
> programmer to confirm that they work as expected, let alone predict when
> they work. I don’t have a good solution, though.
>
> Greetings,
> Joachim
>
> --
> Joachim “nomeata” Breitner
>   mail at joachim-breitner.de • http://www.joachim-breitner.de/
>   Jabber: nomeata at joachim-breitner.de  • GPG-Key: 0xF0FBF51F
>   Debian Developer: nomeata at debian.org
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>