[Haskell-cafe] Toy compression algorithms [was: A very edgy
jcast at ou.edu
Mon Jul 9 16:25:29 EDT 2007
On Monday 09 July 2007, Andrew Coppin wrote:
> Yes, but there are limits to what an optimiser can hope to accomplish.
> For example, you wouldn't implement a bubble sort and seriously expect
> the compiler to be able to "optimise" that into a merge sort, would you?
Something like it's been done; compilers can take in a quadratic time list
reverse and substitute a linear time version:
(pg. 2-3). One of the better all-time papers by the major Haskell
researchers, I'd say.
More information about the Haskell-Cafe