Proof by induction using test sets
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- RRL: A rewrite rule laboratoryPublished by Springer Nature ,1986
- Completion of a set of rules modulo a set of equationsPublished by Association for Computing Machinery (ACM) ,1984
- Rewrite rule theory and abstract data type analysisLecture Notes in Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- 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