A relaxation of Coq's guard condition

Pierre Boutillier (1, 2)

1 PI.R2 - Design, study and implementation of languages for proofs and programs
2 PPS - Preuves, Programmes et Systèmes

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.

Domains: Logic in Computer Science [cs.LO]

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⟩