Abstract
We present the implementation of an efficient universal unification algorithm for the class of equational theories which are induced by primitive recursive tree functions, on an abstract machine and prove its correctness. This machine extends a graph reduction machine by adding mechanisms for the handling of unification and nondeterminism which results from the existence of free variables in the input terms.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call