An overview of Rewrite Rule Laboratory (RRL)
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- RRL: A rewrite rule laboratoryPublished by Springer Nature ,2005
- Proving equivalence of different axiomatizations of free groupsJournal of Automated Reasoning, 1988
- Matching, unification and complexityACM SIGSAM Bulletin, 1987
- On sufficient-completeness and related properties of term rewriting systemsActa Informatica, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- A new method for establishing refutational completeness in theorem provingPublished by Springer Nature ,1986
- Proof by induction using test setsPublished by Springer Nature ,1986
- An equational approach to theorem proving in first-order predicate calculusACM SIGSOFT Software Engineering Notes, 1985
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980