Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions

Authors:
Richard J. Boulton;Konrad Slind
Affiliations:
-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 11
Cited 0

The Oyster-Clam system

CADE-10 Proceedings of the tenth international conference on Automated deduction
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
Automating Induction over Mutually Recursive Functions

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
HOL-ML

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Function Definition in Higher-Order Logic

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Derivation and Use of Induction Schemes in Higher-Order Logic

TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
An Interface between Clam and HOL

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Lazy Generation of Induction Hypotheses

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Combining induction axioms by machine

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper advocates and explores the use of multipredicate induction schemes for proofs about mutually recursive functions. The interactive application of multi-predicate schemes stemming from datatype definitions is already well-established practice; this paper describes an automated proof procedure based on multi-predicate schemes. Multipredicate schemes may be formally derived from (mutually recursive) function definitions; such schemes are often helpful in proving properties of mutually recursive functions where the recursion pattern does not follow that of the underlying datatypes. These ideas have been implemented using the HOL theorem prover and the Clam proof planner.