An efficient representation of arithmetic for term rewriting

Cohen, Dave and Watson, Phil (1991) An efficient representation of arithmetic for term rewriting. In: Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/3-540-53904-2_100

Abstract

We give a locally confluent set of rewrite rules for integer (positive and negative) arithmetic using the familiar system of place notation. We are unable to prove its termination at present, but we strongly conjecture that rewriting with this system terminates and give our reasons. We show that every term has a normal form and so the rewrite system is normalising. We justify our choice of representation in terms of both space efficiency and speed of rewriting. Finally we give several examples of the use of our system.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: term rewriting, arithmetic
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 04 Aug 2009 18:05
Last Modified: 19 Jun 2014 14:21
Resource URI: http://kar.kent.ac.uk/id/eprint/21013 (The current URI for this page, for reference purposes)
  • Depositors only (login required):