[Haskell-cafe] I love purity, but it's killing me.
bulat.ziganshin at gmail.com
Fri Feb 8 02:09:16 EST 2008
Friday, February 8, 2008, 9:33:35 AM, you wrote:
> The process of converting an expression tree to a graph uses either Eq
> or Ord (either derived or a custom instance) to search and build a set
> of unique nodes to be ordered for execution.
in similar situation, i've added hash field to each node, initialized
by smart constructor:
data Expression = Add Hash Expression Expression | ...
add x y = Add (x*y+1234567) x y
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe