We present a computational framework for conceptual blending, a concept invention method
that is advocated in cognitive science as a fundamental and uniquely human engine for …

We describe the design and implementation of an automated theorem prover realising a
fully general notion of cyclic proof. Our tool, called Cyclist, is able to construct proofs obeying …

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be …

HipSpec is a system for automatically deriving and proving properties about functional
programs. It uses a novel approach, combining theory exploration, counterexample testing …

Anti-unification (AU) is a fundamental operation for generalization computation used for
inductive inference. It is the dual operation to unification, an operation at the foundation of …

Monoidal algebraic structures consist of operations that can have multiple outputs as well as
multiple inputs, which have applications in many areas including categorical algebra …

Superposition-based provers have been successfully used to discharge proof obligations
stemming from proof assistants. However, many such obligations require induction to be …

Zeno is a new tool for the automatic generation of proofs of simple properties of functions
over recursively defined data structures. It takes a Haskell program and an assertion as its …

The central concept of theorem designates a claim backed by an irrefutable argument that
follows formal rules, called a proof. Proving theorems is very useful in both Computer …

This paper describes Hipster, a system integrating theory exploration with the proof assistant
Isabelle/HOL. Theory exploration is a technique for automatically discovering new …