Translating Higher-Order Clauses to First-Order Clauses

  title={Translating Higher-Order Clauses to First-Order Clauses},
  author={Jia Meng and Lawrence Charles Paulson},
  journal={Journal of Automated Reasoning},
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. To integrate interactive provers with automatic ones, one must translate higher-order formulas to first-order form. The translation should ideally be both sound and practical. We have investigated several methods of translating function applications, types, and λ-abstractions. Omitting some type information improves the success rate but can be unsound, so the interactive prover must… 
Superposition for Lambda-Free Higher-Order Logic ( Technical Report )
Refutationally complete superposition calculi for intentional and extensional λ-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Set of Support for Higher-Order Reasoning
Limiting how axioms introduced during translation can improve proof search with higher-order problems is shown and heuristics based on the set-of-support strategy for minimising the effects are introduced.
Superposition for Lambda-Free Higher-Order Logic
Refutationally complete superposition calculi for intentional and extensional \(\lambda \)-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Extending a brainiac prover to lambda-free higher-order logic
This work proposes to start with the state-of-the-art superposition prover E and gradually enrich it with higher-order features, explaining how to extend the prover’s data structures, algorithms, and heuristics to higher- order logic, a formalism that supports partial application and applied variables.
Automatic proofs and refutations for higher-order logic
Nitpick is the development of Nitpick, a counterexample generator that builds on a first-order relational model finder that heuristically selects facts relevant to the conjecture to prove and delegates the problem to first- order resolution provers and SMT solvers.
Proving Theorems of Higher-Order Logic with SMT Solvers
It is found that many theorems can now be proved automatically and almost instantaneously for which time-consuming user ingenuity was previously required.
Going Polymorphic - TH1 Reasoning for Leo-III
Modifications to the higher-order automated theorem prover Leo-III are presented for turning it into a reasoning system for rank-1 polymorphic HOL and a suitable paramodulation-based calculus are sketched.
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
The TFF1 format is introduced, an extension of TFF0 with rank-1 polymorphism, designed to be easy to process by existing reasoning tools that support ML-style polymorphism.
A Polymorphic Intermediate Verification Language: Design and Logical Encoding
The paper gives two encodings of types and formulae in simply typed logic such that SMT solvers and other theorem provers can be used to discharge verification conditions.
Boolean Reasoning in a Higher-Order Superposition Prover
We present a pragmatic approach to extending a Boolean-free higher-order superposition calculus to support Boolean reasoning. Our approach extends inference rules that have been used only in a


Translating higher-order problems to first-order clauses
This paper implemented three higher-order to first-order translations, with particular emphasis on the translation of types, and describes the translations and experimental data that compares the three translations in respect of their success rates for various automatic provers.
First-Order Proof Tactics in Higher-Order Logic Theorem Provers In Proc
  • J. Hurd
  • Computer Science, Mathematics
  • 2003
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.
Can a Higher-Order and a First-Order Theorem Prover Cooperate?
This work has shown in the past that higher-order reasoning systems can solve problems of this kind automatically, but the complexity inherent in their calculi and their inefficiency in dealing with large numbers of clauses prevent these systems from solving a whole range of problems.
An LCF-Style Interface between HOL and First-Order Logic
Harrison implemented a version of the MESON procedure with the ability to translate proofs to higher-order logic, and this was integrated as a HOL tactic in 1996, and has since become a standard workhorse of interactive proof.
Automation for interactive proof: First prototype
Using First-Order Theorem Provers in the Jahob Data Structure Verification System
The integration of efficient resolution-based theorem provers into the Jahob data structure verification system enables Jahob to automatically verify the correctness of a range of complex dynamically instantiable data structures, such as hash tables and search trees, without the need for interactive theorem proving or techniques tailored to individual data structures.
Source-Level Proof Reconstruction for Interactive Theorem Proving
This project has implemented source-level proof reconstruction: resolution proofs are automatically translated to Isabelle proof scripts, and each step of a proof is justified by calling Hurd's Metis prover, which has been ported to IsabelLe.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.
Mathematical Induction in Otter-Lambda
  • M. Beeson
  • Computer Science
    Journal of Automated Reasoning
  • 2006
A variety of examples of inductive proofs found by Otter-lambda are presented: some in pure Peano arithmetic, some in Peanos arithmetic with defined predicates, someIn theories combining algebra and the natural numbers, some involving algebraic simplification, and some involving list induction instead of numerical induction.