Is there a such thing as "unifiable data structures"? That is, data structures that have their normal operations with reasonable performance guarantees, but support efficient unification? What keywords should I be searching for?
-
-
Mmmm.. interesting. Every studied Steven Ekers' work on pattern matching modulo associativity and commutativity and idempotency? An ACI cons tree _is_ a set. Good reads! Maybe relevant; how to efficiently (and safely) backtrack, via Pierre Etienne Moreau's backtracking library.
-
Interesting, I may take a peek at that.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.