| Year | 2008 |
|---|---|
| Type | Conference |
| Status | Postproceedings |
| Authors | Georgiana Caltais, Eugen Goriac, Dorel Lucanu, Gheorghe Grigoras |
Links
Abstract
ROC is a deterministic rewrite strategy language which includes the rewrite rules as basic operators, and the deterministic choice and the repetition as high-level strategy operators. In this paper we present a method which, for a given term rewriting system (TRS) \mathbf{R}$, constructs a new TRS $\overline{\mathbf{R}}$ such that $\overline{\mathbf{R}}$-rewriting is equivalent (sound and complete) with $\mathbf{R}$-rewriting constrained by \ROC. Since $\overline{\mathbf{R}}$ uses a stack, it is called a \emph{rewrite stack machine}.
BibTeX
@inproceedings{CaltaisGLG08,
author = {Georgiana Caltais and
Eugen-Ioan Goriac and
Dorel Lucanu and
Gheorghe Grigoras},
title = {A Rewrite Stack Machine for ROC!},
booktitle = {SYNASC},
year = {2008},
pages = {85-91},
publisher = {IEEE Computer Society},
url = {http://synasc08.info.uvt.ro/ [SYNASC]},
url_publisher = {http://www.computer.org/portal/web/csdl/doi/10.1109/SYNASC.2008.76},
}