Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
Logic in Computer Science
2012-04-26 v1 Programming Languages
Abstract
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.
Keywords
Cite
@article{arxiv.1204.5545,
title = {Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic},
author = {Hans Zantema},
journal= {arXiv preprint arXiv:1204.5545},
year = {2012}
}
Comments
In Proceedings WRS 2011, arXiv:1204.5318