A Sceptic's Approach to Combining HOL and Maple

John Harrison and Laurent Théry.

Journal of Automated Reasoning, vol. 21, pp. 279-294, 1998.


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.


Bibtex entry:

        author          = "John Harrison and Laurent Th{\'e}ry",
        title           = "A Skeptic's Approach to Combining {HOL}
                           and {M}aple",
        journal         = "Journal of Automated Reasoning",
        volume          = 21,
        pages           = "279--294",
        year            = 1998}