Thank you for the reference to Strafunski libraries, I read HaskellWiki, but I don't have a permission to visit their site. All links are forbidden.
Can it be a function: fun :: Eq a => Tree a -> [(Int, (a, [Int]))] where tuple codes nodes, and Int's code edges. 2011/8/11 Stephen Tetley <[email protected]> > Wouldn't this be dependent upon your AST and thus not readily > "package-able" as a library? > > Expression simplification has been a prime example for Strafunski > style traversal libraries. You might be able to find examples that you > can adapt to your own AST written with Uniplate or similar library. > > On 11 August 2011 05:00, Anton Kholomiov <[email protected]> > wrote: > > Is there a library on common sub-expression elimination? > > > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe >
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
