Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
From LCF to HOL: a short history
Proof, language, and interaction
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
Proof Terms for Simply Typed Higher Order Logic
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Theory Interpretation in Simple Type Theory
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
NixOS: a purely functional Linux distribution
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Proceedings of the first ACM SIGPLAN symposium on Haskell
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
seL4: formal verification of an OS kernel
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
HOL2P - a system of classical higher order logic with second order polymorphism
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Importing HOL into Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Foundational proof certificates in first-order logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Scalable LCF-Style proof translation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Steps towards verified implementations of HOL light
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
CakeML: a verified implementation of ML
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
Interactive theorem proving is tackling ever larger formalization and verification projects, and there is a critical need for theory engineering techniques to support these efforts. One such technique is cross-prover package management, which has the potential to simplify the development of logical theories and effectively share theories between different theorem prover implementations. The OpenTheory project has developed standards for packaging theories of the higher order logic implemented by the HOL family of theorem provers. What is currently missing is a standard theory library that can serve as a published contract of interoperability and contain proofs of basic properties that would otherwise appear in many theory packages. The core contribution of this paper is the presentation of a standard theory library for higher order logic represented as an OpenTheory package. We identify the core theory set of the HOL family of theorem provers, and describe the process of instrumenting the HOL Light theorem prover to extract a standardized version of its core theory development. We profile the axioms and theorems of our standard theory library and investigate the performance cost of separating the standard theory library into coherent hierarchical theory packages.