Previous |  Up |  Next

Article

Keywords:
terms; unification
Summary:
The paper contains two remarks on finite sets of groupoid terms closed under subterms and the application of unifying pairs.
References:
[1] Dershowitz N., Jouannaud J.-P.: Rewrite systems. Chapter 6, 243-320 in J. van Leeuwen, ed., Handbook of Theoretical Computer Science, B: Formal Methods and Semantics, North Holland, Amsterdam, 1990. MR 1127191 | Zbl 0900.68283
Partner of
EuDML logo