GamePad: A Learning Environment for Theorem Proving

06/02/2018
by   Daniel Huang, et al.
0

In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant. Interactive theorem provers such as Coq enable users to construct machine-checkable proofs in a step-by-step manner. Hence, they provide an opportunity to explore theorem proving at a human level of abstraction. We use GamePad to synthesize proofs for a simple algebraic rewrite problem and train baseline models for a formalization of the Feit-Thompson theorem. We address position evaluation (i.e., predict the number of proof steps left) and tactic prediction (i.e., predict the next proof step) tasks, which arise naturally in human-level theorem proving.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

Proving Parikh's theorem using Chomsky-Schutzenberger theorem

Parikh theorem was originally stated and proved by Rohkit Parikh in MIT ...
research
03/01/2017

HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving

Large computer-understandable proofs consist of millions of intermediate...
research
10/30/2020

Teaching Interactive Proofs to Mathematicians

This work discusses an approach to teach to mathematicians the importanc...
research
05/23/2011

Integrating Testing and Interactive Theorem Proving

Using an interactive theorem prover to reason about programs involves a ...
research
01/04/2021

Lassie: HOL4 Tactics by Example

Proof engineering efforts using interactive theorem proving have yielded...
research
09/27/2022

Structure in Theorem Proving: Analyzing and Improving the Isabelle Archive of Formal Proofs

The Isabelle Archive of Formal Proofs has grown to a significant size in...
research
07/05/2019

From LCF to Isabelle/HOL

Interactive theorem provers have developed dramatically over the past fo...

Please sign up or login with your details

Forgot password? Click here to reset