A Tactic Language for the System Coq

Abstract : We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recursors and matching operators for goq terms but also for proof contexts. It can be used directly in proof scripts or in toplevel denitions (tactic denitions). We show that the implementation of this language involves considerable changes in the interpretation of proof scripts, essentially due to the matching operators. We give some examples which solve small proof parts locally and some others which deal with non-trivial problems. Finally, we discuss the status of this metalanguage with respect to the goq language and the implementation language of goq.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01125070
Contributor : Laboratoire Cedric <>
Submitted on : Thursday, October 25, 2018 - 8:56:50 PM
Last modification on : Saturday, October 27, 2018 - 1:14:26 AM
Long-term archiving on: Saturday, January 26, 2019 - 4:22:36 PM

File

ltac (LPAR'00).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01125070, version 1

Collections

Citation

David Delahaye. A Tactic Language for the System Coq. Proceedings of Logic for Programming and Automated Reasoning (LPAR), Jan 2000, Réunion, France. pp.85-95. ⟨hal-01125070⟩

Share

Metrics

Record views

79

Files downloads

140