Neil Mitchell wrote:
Hi
I guess the question that's really burning in my mind is "if ByteString
is so much faster than [x], why can't you just do the same optimisations
to [x]?" In other words, "why should I need to alter my code to get all
this fusion goodness?"
You already get some benefit of fusion with lists:
* http://research.microsoft.com/~simonpj/Papers/rules.htm
People are working on more:
* http://www-users.cs.york.ac.uk/~ndm/supero/
* http://www.cse.unsw.edu.au/~dons/papers/CLS07.html
* many, many others
I always have trouble tracking exactly which version(s) of GHC actually
implement all this stuff... ;-)
Maybe I'll go find a Linux box sometime and try the head version, just
for kicks...
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
