Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
The Definition of Standard ML
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability)
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Hybrid Interactive Theorem Proving Using Nuprl and HOL
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Importing Mathematics from HOL into Nuprl
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Handbook of automated reasoning
Importing Isabelle Formal Mathematics into NuPRL
Importing Isabelle Formal Mathematics into NuPRL
A formally verified proof of the prime number theorem
ACM Transactions on Computational Logic (TOCL)
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
A foundational view on integration problems
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
We define an interpretation of the Isabelle/HOL logic in HOL Light and its metalanguage, OCaml. Some aspects of the Isabelle logic are not representable directly in the HOL Light object logic. The interpretation thus takes the form of a set of elaboration rules, where features of the Isabelle logic that cannot be represented directly are elaborated to functors in OCaml. We demonstrate the effectiveness of the interpretation via an implementation, translating a significant part of the Isabelle standard library into HOL Light.