Hi all,
This module[1] implements common sub-expression elimination for graphs
generated by the Data.Reify package. (Which is a really neat tool!)
The algorithm performs a simple fixed point iteration and is not
(consciously) optimized for speed.
This package might especially be useful for optimizing simple
compilers for referential transparent domain specific languages. Which
is exactly the reason I've written this code.
An example of the usage is included in the Haddock documentation.
Gr,
--
Sebastiaan Visser
[1] http://hackage.haskell.org/package/data-reify-cse
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
