Definitions by Rewriting in the Calculus of Constructions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Definitions by Rewriting in the Calculus of Constructions

Abstract

The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the beta-rule and the user-defined rules under some general syntactic conditions including confluence. As examples, we show that two important systems satisfy these conditions: a sub-system of the Calculus of Inductive Constructions which is the basis of the proof assistant Coq, and the Natural Deduction Modulo a large class of equational theories.
Fichier principal
Vignette du fichier
main.pdf (218.2 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00105568 , version 1 (11-10-2006)

Identifiers

Cite

Frédéric Blanqui. Definitions by Rewriting in the Calculus of Constructions. 16th Annual IEEE Symposium on Logic in Computer Science, Jun 2001, Boston, United States. ⟨inria-00105568⟩
83 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More