Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

Details Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

2012-04-25

arxiv.org/abs/1204.5545v1

EPTCS 82, 2012, pp. 69-76

Computer Science

Logic in Computer Science

In Proceedings WRS 2011, arXiv:1204.5318

Scientific paper

10.4204/EPTCS.82.5

In this paper we give a criterion by which one can conclude that every
reduction of a basic term to normal form has the same length. As a consequence,
the number of steps to reach the normal form is independent of the chosen
strategy. In particular this holds for TRSs computing addition and
multiplication of natural numbers, both in unary and binary notation.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137344