System description: An interface between CLAM and HOL
The CLAM proof planner has been interfaced to the HOL interactive theorem prover to provide the power of proof planning to people using HOL for formal verification, etc. The interface sends HOL goals to CLAM for planning and translates plans back into HOL tactics that solve the initial goals. The project homepage can be found at http://www.cl.cam.ac.uk/Research/HVG/Clam.HOL/intro.html.
KeywordsFormal Verification High Order Logic Concrete Syntax Proof Plan Constructive Type Theory
Unable to display preview. Download preview PDF.
- 1.R. J. Boulton. Combining decision procedures in the HOL system. In Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications, volume 971 of Lecture Notes in Computer Science. Springer, 1995.Google Scholar
- 2.R. Boulton, A. Bundy, K. Slind, and M. Gordon. A Prototype Interface between CLAM and HOL. Research Paper 854, Department of Artificial Intelligence, University of Edinburgh, June 1997.Google Scholar
- 4.A. P. Felty and D. J. Howe. Hybrid interactive theorem proving using Nuprl and HOL. In Proceedings of the 14th International Conference on Automated Deduction (CADE-I4), volume 1249 of Lecture Notes in Artificial Intelligence. Springer, 1997.Google Scholar
- 5.M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.Google Scholar