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.
|Name||Lecture Notes in Computer Science|
|Publisher||Springer Berlin / Heidelberg|
|Conference||17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010|
|Period||10/10/10 → 15/10/10|