Thank you for the reference to Strafunski libraries, I read<br>HaskellWiki, but I don&#39;t have a permission to visit their site.<br>All links are forbidden. <br><br>Can it be a function:<br><br>fun :: Eq a =&gt; Tree a -&gt; [(Int, (a, [Int]))]<br>
<br>where tuple codes nodes, and Int&#39;s code edges. <br><br><div class="gmail_quote">2011/8/11 Stephen Tetley <span dir="ltr">&lt;<a href="mailto:stephen.tetley@gmail.com">stephen.tetley@gmail.com</a>&gt;</span><br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Wouldn&#39;t this be dependent upon your AST and thus not readily<br>
&quot;package-able&quot; as a library?<br>
<br>
Expression simplification has been a prime example for Strafunski<br>
style traversal libraries. You might be able to find examples that you<br>
can adapt to your own AST written with Uniplate or similar library.<br>
<div class="im"><br>
On 11 August 2011 05:00, Anton Kholomiov &lt;<a href="mailto:anton.kholomiov@gmail.com">anton.kholomiov@gmail.com</a>&gt; wrote:<br>
&gt; Is there a library on common sub-expression elimination?<br>
&gt;<br>
<br>
</div>_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</blockquote></div><br>