A procedure for automatically proving the termination of a set of rewrite rules
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 255-270
- https://doi.org/10.1007/3-540-15976-2_12
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- On multiset orderingsInformation Processing Letters, 1982