Abstract
The paper describes a formal method to derive a simulating term rewriting system from an original system using six elementary syntactical transformations of terms. The derived (or transformed) rewrite systems allow one to mimic the operation of the original system, intended for a certain term domain, in another term domain. The paper presents formalizations for the notions term domain, domain mapping, simulation, transformation and composition of transformations. Formal proofs of the achieved results are presented when appropriate. Examples are given to illustrate the usefulness of the various transformations.
Cite
CITATION STYLE
Verheul, J. C., & Kluit, P. G. (1995). The transformation of term rewriting systems based on well-formedness preserving mappings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 968, pp. 332–352). Springer Verlag. https://doi.org/10.1007/3-540-60381-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
