Abstract
The study of replacement systems is at the heart of computer science and such systems appear in various forms and different contexts: compilers transform object code into machine code, graph grammars rewrite and thereby generate graphs, and the semantics of functional programming languages such as LISP and its variants is defined with the help of term rewriting systems [56, 57, 68, 74, 135, 163, 182]. Program transformations [64, 92, 129, 141], as well as program optimizers [2], data type specifications [29, 111–114, 118–120, 211–214], and algebraic simplifiers [62, 133, 179, 252], also use term rewriting systems; see also [76, 85, 106, 137, 139, 142, 144, 146, 184, 204, 245, 246, 255, 262].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jantzen, M. (1988). Introduction. In: Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61549-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-61549-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64867-0
Online ISBN: 978-3-642-61549-8
eBook Packages: Springer Book Archive