Rewriting modulo in Deduction modulo

Details Rewriting modulo in Deduction modulo Rewriting modulo in Deduction modulo

2006-10-11

arxiv.org/abs/cs/0610071v1

Dans Rewriting Techniques and Applications, 14th International Conference, RTA 2003 2706 (2003)

Computer Science

Logic in Computer Science

Scientific paper

We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computable closure for ensuring the termination of the combination of rewriting and beta-reduction. Here, we show that this result is preserved when considering rewriting modulo a set of equations if the equivalence classes generated by these equations are finite, the equations are linear and satisfy general syntactic conditions also based on the notion of computable closure. This includes equations like associativity and commutativity, and provides an original treatment of termination modulo equations.

Affiliated with

Also associated with

No associations

Rating

Rewriting modulo in Deduction modulo 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 Rewriting modulo in Deduction modulo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rewriting modulo in Deduction modulo will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578725