A Skeptic's Approach to Combining HOL and Maple

We contrast theorem provers and computer algebra systems, pointing out the advantages and disadvantages of each, and suggest a simple way to achieve a synthesis of some of the best features of both. Our method is based on the systematic separation of search for a solution and checking the solution, using a physical connection between systems. We describe the separation of proof search and checking in some detail, relating it to proof planning and to the complexity class NP, and discuss different ways of exploiting a physical link between systems. Finally, the method is illustrated by some concrete examples of computer algebra results proved formally in the HOL theorem prover with the aid of Maple.

[1]  Jacques Calmet,et al.  Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems , 1996, FroCoS.

[2]  John Harrison,et al.  Constructing the real numbers in HOL , 1992, Formal Methods Syst. Des..

[3]  D. Neel.  Tools and Notions for Program Construction: An Advanced Course , 1982 .

[4]  Thomas Kropf,et al.  Integrating A First-order Automatic prover In The HOL Environment , 1991, 1991., International Workshop on the HOL Theorem Proving System and Its Applications.

[5]  C. Pomerance.  Very short primality proofs , 1987 .

[6]  Manuel Blum,et al.  Program Result Checking: A New Approach to Making Programs More Reliable , 1993, ICALP.

[7]  Andrzej Lingas,et al.  Automata, Languages and Programming , 1993, Lecture Notes in Computer Science.

[8]  Richard Boulton,et al.  Efficiency in a fully-expansive theorem prover , 1993 .

[9]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[10]  Lie Yang,et al.  Linking Other Theorem Provers to HOL Using PM: Proof Manager , 1992, TPHOLs.

[11]  R. Boulton.  A Lazy Approach to Fully-Expansive Theorem Proving , 1992, TPHOLs.

[12]  Frank van Harmelen,et al.  Experiments with proof plans for induction , 2004, Journal of Automated Reasoning.

[13]  Robert M. Corless,et al.  Well … it isn't quite that simple , 1992, SIGS.

[14]  Andre Scedrov,et al.  Categories, allegories , 1990, North-Holland mathematical library.

[15]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[16]  Doron Zeilberger,et al.  The Method of Differentiating under the Integral Sign , 1990, J. Symb. Comput..

[17]  Edmund M. Clarke,et al.  Analytica - A Theorem Prover in Mathematica , 1992, CADE.

[18]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[19]  Richard D. Jenks,et al.  AXIOM: the scientific computation system , 1992 .

[20]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1999, Comput. Geom..

[21]  Jeffrey J. Joyce,et al.  A Two-Level Formal Verification Methodology using HOL and COSMOS , 1991, CAV.

[22]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[23]  Konrad Slind.  An Implementation of higher order logic , 1990 .

[24]  John Harrison.  Floating Point Verification in HOL Light: The Exponential Function , 1997, AMAST.

[25]  Michael Beeson,et al.  Mathpert: Computer Support for Learning Algebra, Trig, and Calculus , 1992, LPAR.

[26]  William M. Farmer,et al.  Reasoning with Contexts , 1993, DISCO.

[27]  Ralph Henstock,et al.  A Riemann-Type Integral of Lebesgue Power , 1968, Canadian Journal of Mathematics.

[28]  J. Harrison.  Metatheory and Reflection in Theorem Proving: A Survey and Critique , 1995 .

[29]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[30]  J. Kurzweil.  Generalized ordinary differential equations and continuous dependence on a parameter , 1957 .

[31]  Norbert Kajler,et al.  CAS/PI: a portable and extensible interface for computer algebra systems , 1992, ISSAC '92.

[32]  Dominique Clément,et al.  Integrated Software Components: A Paradigm for Control Integration , 1991, Software Development Environments and CASE Technology.

[33]  J. Harrison.  Constructing the Real Numbers , 1998 .

[34]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..