A language of patterns for subterm selection

Abstract : This paper describes the language of patterns that equips the SSReflect proof shell extension for the Coq system. Patterns are used to focus proof commands on sub expressions of the conjecture under analysis in a declarative manner. They are designed to ease the writing of proof scripts and to increase their readability and maintainability. A pattern can identify the sub expression of interest approximating the sub expression itself, or its enclosing context or both. The user is free to choose the most convenient option. Patterns are matched following an extremely precise and predictable discipline, that is carefully designed to admit an efficient implementation. In this paper we report on the language of patterns, its matching algorithm and its usage in the formal library developed by the Mathematical Components team to support the verification of the Odd Order theorem.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00652286
Contributor : Enrico Tassi <>
Submitted on : Monday, February 13, 2012 - 9:50:58 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Document(s) archivé(s) le : Wednesday, December 14, 2016 - 5:12:22 AM

File

rew.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Georges Gonthier, Enrico Tassi. A language of patterns for subterm selection. ITP, Aug 2012, Princeton, United States. pp.361-376, ⟨10.1007/978-3-642-32347-8_25⟩. ⟨hal-00652286v2⟩

Share

Metrics

Record views

412

Files downloads

282