Abstract
Rewrite rules are sets of ordered pairs of expressions (lhs,rhs) usually depicted as (lns ⇒ rhs). There is usually a similarity relation between the “lhs” and the “rhs” such as equality, inequality or double implication. Rewrite rules, as the pairs are called, together with the rewriting rule of inference allow one expression to be “rewritten” into another. A subexpression of the initial expression is matched with the “lhs” of the rewrite rule yielding a substitution. The resulting expression is the expression obtained by replacing the distinguished subexpression with the “rhs” of the rewrite rule after applying the substitution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Huet, G. and Oppen, D.C. Equations and Rewrite Rules: A Survey. Technical Report CSL-111. SRI international. January. 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Rewrite Rules. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_213
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_213
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive