A relaxation of Coq's guard condition

Pierre Boutillier 1, 2, *
* Corresponding author
1 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00651780
Contributor : Pierre Boutillier <>
Submitted on : Wednesday, December 14, 2011 - 10:56:21 AM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Document(s) archivé(s) le : Thursday, March 15, 2012 - 2:26:38 AM

Files

boutillier.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00651780, version 1

Collections

Citation

Pierre Boutillier. A relaxation of Coq's guard condition. JFLA - Journées Francophones des langages applicatifs - 2012, Feb 2012, Carnac, France. pp.1 - 14, 2012. 〈hal-00651780〉

Share

Metrics

Record views

393

Files downloads

426