Path of subterms ordering and recursive decomposition ordering revisited
- 4 February 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 3 (1-2) , 117-131
- https://doi.org/10.1016/s0747-7171(87)80023-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- On multiset orderingsInformation Processing Letters, 1982
- Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systemsRAIRO. Informatique théorique, 1982
- Proving termination with multiset orderingsCommunications of the ACM, 1979