Abstract
HOL Light is a modern theorem proving system characterised by its powerful, low level interface that allows for flexibility and programmability. However, considerable effort is required to become accustomed to the system and to reach a point where one can comfortably achieve simple natural deduction proofs. Isabelle is another powerful and widely used theorem prover that provides useful features for natural deduction proofs, including its meta-logic and its four main natural deduction tactics. In this paper we describe our efforts to emulate some of these features of Isabelle in HOL Light. One of our aims is to decrease the learning curve of HOL Light and make it more accessible and usable by a range of users, while preserving its programmability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 295–314. Springer, Heidelberg (2005)
Loveland, D.: Mechanical Theorem-Proving by Model Elimination. Journal of the ACM (JACM) 15, 236–251 (1968)
Paulson, L.: Logic and computation: interactive proof with Cambridge LCF. Cambridge Univ. Pr., Cambridge (1990)
Prawitz, D.: Natural deduction: A proof-theoretical study. Almqvist & Wiksell Stockholm (1965)
Harrison, J.: HOL Light: A tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265–269. Springer, Heidelberg (1996)
Harrison, J.: Optimizing proof search in model elimination. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 313–327. Springer, Heidelberg (1996)
Harrison, J.: HOL Light: future wishes. In: Talk at Workshop on Interactive Theorem Proving, Cambridge (2009), http://www.cl.cam.ac.uk/~jrh13/slides/itp-25aug09/slides.pdf
Paulson, L.: Isabelle.: Generic Theorem Prover. Springer, Heidelberg (1994)
Paulson, L.: A generic tableau prover and its integration with Isabelle. J. UCS 5, 73–87 (1999)
Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL: a proof assistant for higher-order logic. Springer, Heidelberg (2002)
Delahaye, D.: A tactic language for the system Coq. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 377–440. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papapanagiotou, P., Fleuriot, J. (2010). An Isabelle-Like Procedural Mode for HOL Light. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-16242-8_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16241-1
Online ISBN: 978-3-642-16242-8
eBook Packages: Computer ScienceComputer Science (R0)