Sharing HOL4 and HOL Light Proof Knowledge

@inproceedings{Gauthier2015SharingHA,
  title={Sharing HOL4 and HOL Light Proof Knowledge},
  author={Thibault Gauthier and C. Kaliszyk},
  booktitle={LPAR},
  year={2015}
}
New proof assistant developments often involve concepts similar to already formalized ones. When proving their properties, a human can often take inspiration from the existing formalized proofs available in other provers or libraries. In this paper we propose and evaluate a number of methods, which strengthen proof automation by learning from proof libraries of different provers. Certain conjectures can be proved directly from the dependencies induced by similar proofs in the other library… 
Aligning concepts across proof assistant libraries
Classification of Alignments Between Concepts of Formal Mathematical Systems
TLDR
This work presents a classification of alignments and design a simple format for describing alignments, as well as an infrastructure for sharing them, and proposes these as a centralized standard for the community.
Higher Order Proof Engineering: Proof Collaboration, Transformation, Checking and Retrieval
TLDR
An introduction and an overview of related recent advances are given, followed by the proof checking benchmarks of a proof sharing repository, namely OpenTheory (after proof transformation by the upgraded Holide), and ProofCloud, the first proof retrieval engine for higher order proofs.
Proof Artifact Co-training for Theorem Proving with Language Models
TLDR
PACT is proposed, a general methodology for extracting abundant self-supervised data from kernel-level proof terms for co-training alongside the usual tactic prediction objective and applied to Lean, an interactive proof assistant which hosts some of the most sophisticated formalized mathematics to date.
JEFL: Joint Embedding of Formal Proof Libraries
TLDR
This paper compares a previously proposed algorithm for matching concepts across libraries with an unsupervised embedding approach that can help us retrieve similar concepts and argues that the neural embedding Approach has more potential to be integrated into an interactive proof assistant.
A Standard for Aligning Mathematical Concepts
TLDR
This work proposes these as a centralized standard for the community to collect and curate alignments from the different kinds of mathematical corpora, including proof assistant libraries, computer algebra and programming language algorithms, and semi-formal libraries.
Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
TLDR
This paper discusses the design of a hierarchy of structures which combine linear algebra with concepts related to limits, like topology and norms, in dependent type theory, and presents and discusses a solution, coined forgetful inheritance, based on packed classes and unification hints.
QED at Large: A Survey of Engineering of Formally Verified Software
TLDR
A survey of the literature presents a holistic understanding of proof engineering for program correctness, covering impact in practice, foundations, proof automation, proof organization, and practical proof development.
A Survey of Languages for Formalizing Mathematics
TLDR
The conclusion is reached that no existing language is truly good enough yet and ideas for possible future improvements are derived.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Premise Selection and External Provers for HOL4
TLDR
An add-on to the HOL4 proof assistant and an adaptation of the HOL(y)Hammer system that provides machine learning-based premise selection and automated reasoning also for HOL4, which directly benefits HOL4 users by automatically finding proofs dependencies that can be reconstructed by Metis.
Efficient Semantic Features for Automated Reasoning over Large Theories
TLDR
This work proposes novel semantic features characterizing the statements in such large semantic knowledge bases and carries out their efficient implementation using deductive-AI data-structures such as substitution trees and discrimination nets, and shows that they significantly improve the strength of existing knowledge selection methods and automated reasoning methods over the large formal knowledge bases.
30 years of research and development around Coq
TLDR
The Coq Proof Assistant is an interactive software system based on higher-order type theory, designed and implemented by a team of French researchers as a continuous effort over the last 30 years, allowing its use as a high-level language fit for the development of compositional mathematical components.
Scalable LCF-Style Proof Translation
TLDR
This paper provides a new implementation of a theory import from HOL Light to Isabelle/HOL, which achieves decent performance and scalability mostly by avoiding the mistakes of the past and provides mappings for most basic types present in the developments including lists, integers and real numbers.
Matching Concepts across HOL Libraries
TLDR
Many proof assistant libraries contain formalizations of the same mathematical concepts, but for more advanced concepts, finding similar formalizations in different libraries is a non-trivial task even for an expert.
The OpenTheory Standard Theory Library
  • J. Hurd
  • Computer Science
    NASA Formal Methods
  • 2011
TLDR
The core contribution of this paper is the presentation of a standard theory library for higher order logic represented as an OpenTheory package, and the process of instrumenting the HOL Light theorem prover to extract a standardized version of its core theory development.
HOL Light: An Overview
TLDR
HOL Light is an interactive proof assistant for classical higher-order logic intended as a clean and simplified version of Mike Gordon's original HOL system and provides powerful proof tools and has been applied to some non-trivial tasks in the formalization of mathematics and industrial formal verification.
First-Order Proof Tactics in Higher-Order Logic Theorem Provers In Proc
  • J. Hurd
  • Computer Science, Mathematics
  • 2003
TLDR
The core integrating technology is described: an ‘LCFstyle’ logical kernel for clausal first-order logic that allows the choice of different logical mappings between higher- order logic and first-orders to be used depending on the subgoal, and also enables several different first- order proof procedures to cooperate on constructing the proof.
Structured Formal Development in Isabelle
TLDR
This paper presents a constructive approach to adding theory morphisms and parametrisation to theorem provers, while preserving the proof support and consistency of the prover.
HOL(y)Hammer: Online ATP Service for HOL Light
TLDR
HOL(y)Hammer is an online AI/ATP service for formal mathematics encoded in the HOL Light system that allows its users to upload and automatically process an arbitrary formal development based on HOL Light, and to attack arbitrary conjectures that use the concepts defined in some of the uploaded projects.
...
...