Tactic Learning and Proving for the Coq Proof Assistant

03/20/2020
by   Lasse Blaauwbroek, et al.
0

We present a system that utilizes machine learning for tactic proof search in the Coq Proof Assistant. In a similar vein as the TacticToe project for HOL4, our system predicts appropriate tactics and finds proofs in the form of tactic scripts. To do this, it learns from previous tactic scripts and how they are applied to proof states. The performance of the system is evaluated on the Coq Standard Library. Currently, our predictor can identify the correct tactic to be applied to a proof state 23.4 automatically prove 39.3 system, the two systems together prove 56.7

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2017

Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems

We describe the first results of a project of analyzing in which theorie...
research
09/11/2015

Sharing HOL4 and HOL Light proof knowledge

New proof assistant developments often involve concepts similar to alrea...
research
04/12/2021

Online Machine Learning Techniques for Coq: A Comparison

We present a comparison of several online machine learning techniques fo...
research
06/04/2019

Learning dynamic polynomial proofs

Polynomial inequalities lie at the heart of many mathematical discipline...
research
04/24/2023

How can we prove that a proof search method is not an instance of another?

We introduce a method to prove that a proof search method is not an inst...
research
06/12/2018

Goal-Oriented Conjecturing for Isabelle/HOL

We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof...
research
09/25/2003

Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements

We present the first class of mathematically rigorous, general, fully se...

Please sign up or login with your details

Forgot password? Click here to reset