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?
-
-
Replying to @BrandonBloom
Haskell has a good library for this. It leverages traversability. It's not impossible to port this with by-hand runtime metaprogramming methods for general structures so long as you can change the type guarantees. Golang 2 will probably be able to do it. http://hackage.haskell.org/package/unification-fd-0.10.0.1/docs/Control-Unification.html …
2 replies 0 retweets 3 likes -
Replying to @KirinDave @BrandonBloom
Unification is usually linear on any given data structure for the size of the data structure, so the only really critical guarantee you need is efficient traversal and it really helps to have some approximation of continuations for better options in search algorithms.
1 reply 0 retweets 0 likes
Why linear in size of data structure and not in number of variables? Presumably you could store paths to variables, or use a zipper structure to make it O(1) to find a variable.
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.