Results 1 
8 of
8
Simulation as a correct transformation of rewrite systems
 In Proceedings of 22nd Symposium on Mathematical Foundations of Computer Science, LNCS 1295
, 1997
"... Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves te ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct step in the compilation of the original rewrite system. That is, the normal forms of a term in the original rewrite system can then be obtained by computing the normal forms of a related term in the simulating rewrite system. 1
Within ARM's Reach: Compilation of LeftLinear Rewrite Systems via Minimal Rewrite Systems
, 1997
"... A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).
Experiments with Partial Evaluation Domains for Rewrite Specifications
 In Magne Haveraaen, Olaf Owe, and OleJohan Dahl, editors, Recent Trends in Data Type Specifications (LNCS 1130
, 1995
"... . We describe a method to improve the efficiency of normalization procedures for term rewriting systems. This improvement does not restrict the semantics of the term rewriting specification in any respect. In particular, the expressive power of term rewriting systems as a programming language for ge ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
. We describe a method to improve the efficiency of normalization procedures for term rewriting systems. This improvement does not restrict the semantics of the term rewriting specification in any respect. In particular, the expressive power of term rewriting systems as a programming language for generic programs and as a theorem prover has been preserved. Our method is basedon the following observation. Many rewrite specifications are instances of theories for which efficient data structures exist. In that case we can exploit the canonical representation of objects of such a data structure by translating terms to corresponding objects, and retranslating these objects to terms (in normal form). We will call an implementation of a data structure that allows for this kind of transformations for all (not necessarily ground) terms an evaluation domain. This is then extended to the case where only part of a rewrite specification can directly be transformed using an evaluation domain. We dev...
Correct Transformation of Rewrite Systems for Implementation Purposes
"... We propose the notion of a correct transformation of one rewrite system into another. If such a transformation is correct, then the normal forms of a term in the original rewrite system can be obtained by computing the normal forms of the interpretation of this term in the transformed rewrite system ..."
Abstract
 Add to MetaCart
(Show Context)
We propose the notion of a correct transformation of one rewrite system into another. If such a transformation is correct, then the normal forms of a term in the original rewrite system can be obtained by computing the normal forms of the interpretation of this term in the transformed rewrite system. We showfor several transformations from the literature that they are correct, most notably for the notion of simulation from Kamperman and Walters. 1
Compilation of LeftLinear Rewrite Systems via Minimal Rewrite Systems
, 1997
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract
 Add to MetaCart
(Show Context)
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of