论文信息 - Derivation and Use of Induction Schemes in Higher-Order Logic

Derivation and Use of Induction Schemes in Higher-Order Logic

We discuss how to formally derive induction schemes for recursively defined functions in higher order logic. The functions are able to be defined using ML-style pattern-matching, and the induction schemes are also phrased in terms of these patterns. As part of the TFL system, this facility is portable: it has been incorporated into both the HOL and Isabelle systems.

Konrad Slind

[1] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[2] Konrad Slind,et al. Function Definition in Higher-Order Logic , 1996, TPHOLs.

[3] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.

[4] Holger Busch. Unification Based Induction , 1992, TPHOLs.

[5] Deepak Kapur,et al. Automating Induction over Mutually Recursive Functions , 1996, AMAST.

[6] Richard J. Boulton,et al. A Prototype Interface Between CLAM and HOL , 1997 .

[7] Richard J. Boulton,et al. An Interface between Clam and HOL , 1998, TPHOLs.

[8] Luc Maranget,et al. Two Techniques for Compiling Lazy Pattern Matching , 1994 .

[9] Lennart Augustsson,et al. Compiling Pattern Matching , 1985, FPCA.

[10] T. Melham. Automating recursive type definitions in higher order logic , 1989 .

[11] Lawrence C. Paulson,et al. Verifying the Unification Algorithm in LCF , 1985, Sci. Comput. Program..