Proving inductive theorems based on term rewriting systems
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 180-190
- https://doi.org/10.1007/3-540-50667-5_70
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Proving inductive theorems based on term rewriting systemsPublished by Springer Nature ,1988
- On sufficient-completeness and related properties of term rewriting systemsActa Informatica, 1987
- Proof by consistencyArtificial Intelligence, 1987
- How to prove equivalence of term rewriting systems without inductionPublished by Springer Nature ,1986
- A Strong restriction of the inductive completion procedureLecture Notes in Computer Science, 1986
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 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