Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
- 1 January 1982
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 16 (4), 331-347
- https://doi.org/10.1051/ita/1982160403311
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- On multiset orderingsInformation Processing Letters, 1982
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A note on simplification orderingsInformation Processing Letters, 1979
- Description and analysis of an efficient priority queue representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's ConjectureTransactions of the American Mathematical Society, 1960