Composable discovery engines for interactive theorem proving

Authors:
Phil Scott;Jacques Fleuriot
Affiliations:
Centre for Intelligent Systems and their Applications, Informatics Forum, University of Edinburgh, Edinburgh, UK;Centre for Intelligent Systems and their Applications, Informatics Forum, University of Edinburgh, Edinburgh, UK
Venue:
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Year:
2011

Citing 7
Cited 2

HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Mizar Light for HOL Light

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Monads for Functional Programming

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Automation for interactive proof: first prototype

Information and Computation - Special issue: Combining logical systems
Applicative programming with effects

Journal of Functional Programming
Algebras for combinatorial search

Journal of Functional Programming
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous

Electronic Notes in Theoretical Computer Science (ENTCS)

An investigation of hilbert's implicit reasoning through proof discovery in idle-time

ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
A combinator language for theorem discovery

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a framework to integrate discovery engines with interactive theorem proving, and define an algebra for composing them. Discovery engines can be tailored to specific domains and invoked concurrently as the user writes the proof. The engines collaborate with the user by inferring facts from the current goal context, and providing new theorems to advance the proof. We have developed the system in HOL Light [1], and have used it in a non-trivial setting, namely incidence-reasoning for geometry theorem proving.