ePrints

A Rewriting Machine and Optimization of Strategies of Term Rewriting

Lookup NU author(s): Dr Victor Khomenko

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

An algebraic specification of a new rewriting machine for fast rewriting of terms is considered. Theorems on the correctness of this specification are proved. A method for optimization of a strategy of iterative rewriting is proposed.

Publication metadata

Author(s): Letichevskii A, Khomenko V

Publication type: Article

Publication status: Published

Journal: Cybernetics and Systems Analysis

Year: 2002

Volume: 38

Issue: 5

Pages: 637-649

Print publication date: 01/01/2002

ISSN (print): 1060-0396

ISSN (electronic): 1573-8337

Publisher: Springer

URL: http://dx.doi.org/10.1023/A:1021819523233

DOI: 10.1023/A:1021819523233

Altmetrics

Share