Proof of termination of the rewriting system subst on CCL
Authors:
- Thérèse HardinTHThérèse Hardin
- Alain LavilleALAlain Laville
- 1 January 1986
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 46, 305-312
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systemsRAIRO. Informatique théorique, 1982
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proving termination with multiset orderingsCommunications of the ACM, 1979