TIP is a toolbox for users and developers of inductive provers. It consists of a large number of tools which can, for example, simplify an inductive problem, monomorphise it or find counterexamples to it. We are using TIP to help maintain a set of benchmarks for inductive theorem provers, where its main job is to encode aspects of the problem that are not natively supported by the respective provers. TIP makes it easier to write inductive provers, by supplying necessary tools such as lemma discovery which prover authors can simply import into their own prover
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of too...
This paper describes our collection of benchmarks for inductive theorem provers. The recent spur of ...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
Abstract(Automated) Inductive Theorem Proving (ITP) is a challenging field in automated reasoning an...
We present a brief overview on completion based inductive theorem proving techniques, point out the ...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
We use abstraction as a tool to paln proofs by inductive inside ABSFOL, an interactive theorem prove...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
The mathematical community (appropriately defined) faces a great challenge to re-evaluate the role o...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging probl...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of too...
This paper describes our collection of benchmarks for inductive theorem provers. The recent spur of ...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
Abstract(Automated) Inductive Theorem Proving (ITP) is a challenging field in automated reasoning an...
We present a brief overview on completion based inductive theorem proving techniques, point out the ...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
We use abstraction as a tool to paln proofs by inductive inside ABSFOL, an interactive theorem prove...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
The mathematical community (appropriately defined) faces a great challenge to re-evaluate the role o...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging probl...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...
Over the past few years, machine learning has been successfully combined with automated theorem pro...