Automating induction over mutually recursive functions
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 117-131
- https://doi.org/10.1007/bfb0014311
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A mechanizable induction principle for equational specificationsPublished by Springer Nature ,2005
- Using induction and rewriting to verify and complete parameterized specificationsTheoretical Computer Science, 1996
- Automating induction over mutually recursive functionsPublished by Springer Nature ,1996
- Implicit induction in conditional theoriesJournal of Automated Reasoning, 1995
- An overview of Rewrite Rule Laboratory (RRL)Computers & Mathematics with Applications, 1995
- Induction using term orderingsPublished by Springer Nature ,1994
- Using linear arithmetic procedure for generating induction schemesPublished by Springer Nature ,1994
- Termination of rewritingJournal of Symbolic Computation, 1987