Re:Ask HN: What are some cool but obscure data structures yo...
by Twisol on Friday July 22, 2022 @05:08AM
(#32190067)
I had a similar thought when I learned about e-graphs. I'm not sure yet, but I think congruence closure is a slightly different problem from the one Prolog unification solves. In particular, if you tell an e-graph that `f(x) = g(y)`, it will take you at your word -- while Prolog would give a unification error. (An e-graph should also handle `X = f(X)`, while this would fail Prolog's admittedly often-ignored occurs check.)
[ Parent
| on HN ]
There are no comments on this comment yet.