An abstract type for constructing tactics in Coq

Arnaud Spiwack 1, 2
2 TYPICAL - Types, Logic and computing
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : The Coq proof assistant is a large development, a lot of which happens to be more or less dependent on the type of tactics. To be able to perform tweaks in this type more easily in the future, we propose an API for building tactics which doesn't need to expose the type of tactics and yet has a fairly small amount of primitives. This API accompanies an entirely new implementation of the core tactic engine of Coq which aims at handling more gracefully existential variables (aka. metavariables) in proofs - like in more recent proof assistants like Matita and Agda2. We shall, then, leverage this newly acquired independence of the concrete type of tactics from the API to add backtracking abilities.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00502500
Contributor : Arnaud Spiwack <>
Submitted on : Thursday, July 15, 2010 - 10:36:26 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM
Long-term archiving on : Tuesday, October 23, 2012 - 10:20:58 AM

File

tactics.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00502500, version 1

Collections

Citation

Arnaud Spiwack. An abstract type for constructing tactics in Coq. Proof Search in Type Theory, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00502500⟩

Share

Metrics

Record views

387

Files downloads

184