Results 1 
6 of
6
Importing HOL Light into Coq
 In ITP
, 2010
"... Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be reused and rechecked. By relying on a carefully chosen embedding of HigherOrder Logic into Type Theory, we try to avoid some pitfalls of interoperation between proof systems. In parti ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be reused and rechecked. By relying on a carefully chosen embedding of HigherOrder Logic into Type Theory, we try to avoid some pitfalls of interoperation 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. 1
Composable Packages for Higher Order Logic Theories
"... 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 effective package management, which has the potential to simplify the development of logical the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
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 effective package management, which has the potential to simplify the development of logical theories by precisely checking dependencies and promoting reuse. This paper introduces a domainspecific language for defining composable packages of higher order logic theories, which is designed to naturally handle the complex dependency structures that often arise in theory development. The package composition language functions as a module system for theories, and the paper presents a welldefined semantics for the supported operations. Preliminary tests of the package language and its toolset have been made by packaging the theories distributed with the HOL Light theorem prover. This experience is described, leading to some initial theory engineering discussion on the ideal properties of a reusable theory. 1
Towards knowledge management for HOL Light
 Proc. of the 7th Conference on Intelligent Computer Mathematics (CICM’14), volume 8543 of LNCS
, 2014
"... Abstract. The libraries of deduction systems are growing constantly, so much that knowledge management concerns are becoming increasingly urgent to address. However, due to time constraints and legacy design choices, there is barely any deduction system that can keep up with the MKM state of the art ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The libraries of deduction systems are growing constantly, so much that knowledge management concerns are becoming increasingly urgent to address. However, due to time constraints and legacy design choices, there is barely any deduction system that can keep up with the MKM state of the art. HOL Light in particular was designed as a lightweight deduction system that systematically relegates most MKM aspects to external solutions — not even the list of theorems is stored by the HOL Light kernel. We make the first and hardest step towards knowledge management for HOL Light: We provide a representation of the HOL Light library in a standard MKM format that preserves the logical semantics and notations but is independent of the system itself. This provides an interface layer at which independent MKM applications can be developed. Moreover, we develop two such applications as examples. We employ the MMT system and its interactive web browser to view and navigate the library. And we
Standalone Tactics using OpenTheory
"... Abstract. Proof tools in interactive theorem provers are usually developed within and tied to a specific system, which leads to a duplication of effort to make the functionality available in different systems. Many verification projects would benefit from access to proof tools developed in other sys ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Proof tools in interactive theorem provers are usually developed within and tied to a specific system, which leads to a duplication of effort to make the functionality available in different systems. Many verification projects would benefit from access to proof tools developed in other systems. Using OpenTheory as a language for communicating between systems, we show how to turn a proof tool implemented for one system into a standalone tactic available to many systems via the internet. This enables, for example, LCFstyle proof reconstruction efforts to be shared by users of different interactive theorem provers and removes the need for each user to install the external tool being integrated. 1
Evaluation Opportunities in Mechanized Theories (Invited Talk Abstract)
"... When evaluating logic solvers, it is essential to take into account the application domain in which ..."
Abstract
 Add to MetaCart
(Show Context)
When evaluating logic solvers, it is essential to take into account the application domain in which