A relaxation of Coq's guard condition - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

A relaxation of Coq's guard condition


In a convenient language to handle dependent algebraic data types, this article describes how commutative cuts are used to tackle dependency in pattern matching. It defines a new termination criteria by structural guard condition that allows commutative cuts. Everything exposed scales directly to the Coq proof assistant and describes its implementation. The proof of strong normalisation does not and is still work to do.
Fichier principal
Vignette du fichier
boutillier.pdf (203.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00651780 , version 1 (14-12-2011)


  • HAL Id : hal-00651780 , version 1


Pierre Boutillier. A relaxation of Coq's guard condition. JFLA - Journées Francophones des langages applicatifs - 2012, Feb 2012, Carnac, France. pp.1 - 14. ⟨hal-00651780⟩
210 View
323 Download


Gmail Facebook X LinkedIn More