Induction using term orderings
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 102-117
- https://doi.org/10.1007/3-540-58156-1_8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Proof by consistency in equational theoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Proof by consistency in conditional equational theoriesPublished by Springer Nature ,1991
- Conditional rewriting in focusPublished by Springer Nature ,1991
- Proving inductive theorems based on term rewriting systemsPublished by Springer Nature ,1988
- Inductive methods for reasoning about abstract data typesPublished by Association for Computing Machinery (ACM) ,1988
- The karlsruhe induction theorem proving systemPublished by Springer Nature ,1986
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969