Computer Science – Logic in Computer Science
Scientific paper
2006-10-11
Dans 16th Annual IEEE Symposium on Logic in Computer Science (2001)
Computer Science
Logic in Computer Science
Best student paper (Kleene Award)
Scientific 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.
No associations
LandOfFree
Definitions by Rewriting in the Calculus of Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Definitions by Rewriting in the Calculus of Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Definitions by Rewriting in the Calculus of Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-578717