English

Towards Automatic Transformations of Coq Proof Scripts

Logic in Computer Science 2024-01-23 v1 Symbolic Computation Software Engineering

Abstract

Proof assistants like Coq are increasingly popular to help mathematicians carry out proofs of the results they conjecture. However, formal proofs remain highly technical and are especially difficult to reuse. In this paper, we present a framework to carry out a posteriori script transformations. These transformations are meant to be applied as an automated post-processing step, once the proof has been completed. As an example, we present a transformation which takes an arbitrary large proof script and produces an equivalent single-line proof script, which can be executed by Coq in one single step. Other applications, such as fully expanding a proof script (for debugging purposes), removing all named hypotheses, etc. could be developed within this framework. We apply our tool to various Coq proof scripts, including some from the GeoCoq library.

Keywords

Cite

@article{arxiv.2401.11897,
  title  = {Towards Automatic Transformations of Coq Proof Scripts},
  author = {Nicolas Magaud},
  journal= {arXiv preprint arXiv:2401.11897},
  year   = {2024}
}

Comments

In Proceedings ADG 2023, arXiv:2401.10725

R2 v1 2026-06-28T14:23:26.632Z