Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Recording and Checking HOL Proofs
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Comparative Study of Coq and HOL
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Proof Terms for Simply Typed Higher Order Logic
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A Prototype Proof Translator from HOL to Coq
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Type-safe modular hash-consing
Proceedings of the 2006 workshop on ML
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple types in type theory: deep and shallow encodings
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Towards self-verification of HOL light
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Importing HOL into Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A foundational view on integration problems
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Self-certification: bootstrapping certified typecheckers in F* with Coq
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The HOL Light Theory of Euclidean Space
Journal of Automated Reasoning
Scalable LCF-Style proof translation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Verifying a plaftorm for digital imaging: a multi-tool strategy
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and re-checked. By relying on a carefully chosen embedding of Higher-Order Logic into Type Theory, we try to avoid some pitfalls of inter-operation between proof systems. In particular, our translation keeps the mathematical statements intelligible. This translation has been implemented and allows the importation of the HOL Light basic library into Coq.