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?
-
-
So you want all of the maps out of your type to also be unified in some sort of way? If two types both support a map named q then q(unify(x, y)) = unify(q(x), q(y))?
-
I've thought a bunch about this since he replied. It seems to me like what it'd end up being is a way to inject bindings into a tree, and to directly model how unassigned variables interact with it at the insert/remove level of the data structure.
-
Oh sure, I definitely imagine this being done in a binding context. It’s first-order unification I believe.
End of conversation
New conversation -
-
-
I'm not sure we would expect such a thing. It's a search operation, so it's data structure as a tree w/ different branching rules is kinda fixed. The fact that we can weave search through the unification/production of an arbitrary data structure seems significant on it's own.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.