Coq's Prolog and application to defining semi-automatic tactics

Théo Zimmermann 1, 2 Hugo Herbelin 1, 2
1 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, UPD7 - Université Paris Diderot - Paris 7, PPS - Preuves, Programmes et Systèmes
Abstract : We report on a work-in-progress to re-implement Coq's apply tactic in order to embed some form of simple automation. We design it in a declarative way, relying on typeclasses eauto, a tactic which gives access to the proof-search mechanism behind type classes. We qualify this mechanism of " Coq's Prolog " and describe it in a generic way and explain how it can be used to support the construction of automatic and semi-automatic tactics.
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download
Contributor : Théo Zimmermann <>
Submitted on : Friday, December 22, 2017 - 6:21:13 PM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM


Files produced by the author(s)


  • HAL Id : hal-01671994, version 1



Théo Zimmermann, Hugo Herbelin. Coq's Prolog and application to defining semi-automatic tactics. Type Theory Based Tools, Jan 2017, Paris, France. ⟨hal-01671994⟩



Record views


Files downloads