Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

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 multipli...

Full description

Bibliographic Details
Main Author: Hans Zantema
Format: Article
Language:English
Published: Open Publishing Association 2012-04-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1204.5545v1
id doaj-c0a47022545040cfab26fbc537cd59bf
record_format Article
spelling doaj-c0a47022545040cfab26fbc537cd59bf2020-11-24T20:46:26ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-04-0182Proc. WRS 2011697610.4204/EPTCS.82.5Strategy Independent Reduction Lengths in Rewriting and Binary ArithmeticHans ZantemaIn 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.http://arxiv.org/pdf/1204.5545v1
collection DOAJ
language English
format Article
sources DOAJ
author Hans Zantema
spellingShingle Hans Zantema
Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
Electronic Proceedings in Theoretical Computer Science
author_facet Hans Zantema
author_sort Hans Zantema
title Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
title_short Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
title_full Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
title_fullStr Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
title_full_unstemmed Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
title_sort strategy independent reduction lengths in rewriting and binary arithmetic
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-04-01
description 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.
url http://arxiv.org/pdf/1204.5545v1
work_keys_str_mv AT hanszantema strategyindependentreductionlengthsinrewritingandbinaryarithmetic
_version_ 1716812644472586240

Similar Items