Reveur-3: the implementation of a general completion procedure parameterized by built-in theories and strategies
- 28 February 1987
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 8 (1) , 69-86
- https://doi.org/10.1016/0167-6423(87)90004-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Principles of OBJ2Published by Association for Computing Machinery (ACM) ,1985
- NARROWER: a new algorithm for unification and its application to Logic ProgrammingLecture Notes in Computer Science, 1985
- Associative path orderingsPublished by Springer Nature ,1985
- ERIL — Equational reasoning: an interactive laboratoryLecture Notes in Computer Science, 1985
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- CLU Reference ManualPublished by Springer Nature ,1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Deciding unique termination of permutative rewriting systems: Choose your term algebra carefullyPublished by Springer Nature ,1980