A language of patterns for subterm selection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

A language of patterns for subterm selection


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

Dates and versions

hal-00652286 , version 1 (15-12-2011)
hal-00652286 , version 2 (13-02-2012)



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⟩
480 View
552 Download



Gmail Facebook X LinkedIn More