An abstract type for constructing tactics in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

An abstract type for constructing tactics in Coq


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.
Fichier principal
Vignette du fichier
tactics.pdf (93.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00502500 , version 1 (15-07-2010)


  • HAL Id : inria-00502500 , version 1


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


Gmail Facebook Twitter LinkedIn More