Polygraphs for termination of left-linear term rewriting systems

Details Polygraphs for termination of left-linear term rewriting systems Polygraphs for termination of left-linear term rewriting systems

2007-02-07

arxiv.org/abs/cs/0702040v1

Computer Science

Logic in Computer Science

15 pages

Scientific paper

We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni's polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of minimal size whose termination is proven with a polygraphic interpretation, then we get back the property on the TRS. We recall Yves Lafont's general translation of TRSs into polygraphs and known links between their termination properties. We give several conditions on the original TRS, including being a first-order functional program, that ensure that we can reduce the size of the polygraphic translation. We also prove sufficient conditions on the polygraphic interpretations of a minimal translation to imply termination of the original TRS. Examples are given to compare this method with usual polynomial interpretations.

Affiliated with

Also associated with

No associations

Rating

Polygraphs for termination of left-linear term rewriting systems 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 Polygraphs for termination of left-linear term rewriting systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polygraphs for termination of left-linear term rewriting systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218431