A mechanizable induction principle for equational specifications
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 162-181
- https://doi.org/10.1007/bfb0012831
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- Formulation of induction formulas in verification of prolog programsPublished by Springer Nature ,1986
- Proof by induction using test setsPublished by Springer Nature ,1986
- RRL: A rewrite rule laboratoryPublished by Springer Nature ,1986
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- The algebraic specification of abstract data typesActa Informatica, 1978
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969
- A Basis for a Mathematical Theory of Computation)Published by Elsevier ,1963