Definitions by rewriting in the Calculus of Constructions. F. Blanqui. LICS'01, 10 pages. Kleene award for best student paper.

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.


Statcounter W3C Validator Last updated on 26 October 2016. Come back to main page.