[Haskell-beginners] Average of numeric list

Tom Murphy amindfv at gmail.com
Tue Apr 5 18:30:35 CEST 2011

> > I've always wondered, is it imaginable that a compiler would be able to
> > do such transforms (assuming very intelligent people (i.e. not me)
> > have plenty of time to work on it), or is it way too complicated ?

> Spotting more patterns would require more code in the compiler, and it
> would increase compile times.
> So one has to decide whether the cost is worth the benefit.
> Apparently, so far it has not been considered worthwhile.

It seems to me that, in almost every case, the cost of performance slow-down
is greater than the cost of compilation slow-down.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20110405/ced7a2c1/attachment.htm>

More information about the Beginners mailing list