Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
Logic and Computation: Interactive Proof with Cambridge LCF
Logic and Computation: Interactive Proof with Cambridge LCF
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Optimizing Proof Search in Model Elimination
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A tactic language for the system Coq
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
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.