Editing Rewriting (section)

== Further reading ==
* {{cite book |first1=Franz|last1=Baader|author1-link=Franz Baader |first2=Tobias|last2=Nipkow|author2-link=Tobias Nipkow |title=Term rewriting and all that |publisher=Cambridge University Press |isbn = 978-0-521-77920-3 |year=1999 }} 316 pages.
* [[Marc Bezem]], [[Jan Willem Klop]], [[Roel de Vrijer]] ("Terese"), ''Term Rewriting Systems'' ("TeReSe"), Cambridge University Press, 2003, {{ISBN|0-521-39115-6}}. This is the most recent comprehensive monograph. It uses however a fair deal of non-yet-standard notations and definitions. For instance, the Church–Rosser property is defined to be identical with confluence.
* [[Nachum Dershowitz]] and [[Jean-Pierre Jouannaud]] [http://citeseer.ist.psu.edu/dershowitz90rewrite.html "Rewrite Systems"], Chapter 6 in [[Jan van Leeuwen]] (Ed.), ''[[Handbook of Theoretical Computer Science]], Volume B: Formal Models and Semantics.'', Elsevier and MIT Press, 1990, {{isbn|0-444-88074-7}}, pp.&nbsp;243&ndash;320. The [[preprint]] of this chapter is freely available from the authors, but it is missing the figures.
* Nachum Dershowitz and [[David Plaisted]]. [https://www.cs.tau.ac.il/~nachum/papers/hand-final.pdf "Rewriting"], Chapter 9 in [[John Alan Robinson]] and [[Andrei Voronkov]] (Eds.), ''[[Handbook of Automated Reasoning]], Volume 1''.
* [[Gérard Huet]] et Derek Oppen, [http://infolab.stanford.edu/pub/cstr/reports/cs/tr/80/785/CS-TR-80-785.pdf Equations and Rewrite Rules, A Survey] (1980) Stanford Verification Group, Report N° 15 Computer Science Department Report N° STAN-CS-80-785
* [[Jan Willem Klop]]. "Term Rewriting Systems", Chapter 1 in [[Samson Abramsky]], [[Dov M. Gabbay]] and [[Tom Maibaum]] (Eds.), ''[[Handbook of Logic in Computer Science]], Volume 2: Background: Computational Structures''.
* David Plaisted. [http://rewriting.loria.fr/documents/plaisted.ps.gz "Equational reasoning and term rewriting systems"], in [[Dov M. Gabbay]], [[C. J. Hogger]] and [[John Alan Robinson]] (Eds.), ''[[Handbook of Logic in Artificial Intelligence and Logic Programming]], Volume 1''.
* Jürgen Avenhaus and Klaus Madlener. "Term rewriting and equational reasoning". In Ranan B. Banerji (Ed.), ''Formal Techniques in Artificial Intelligence: A Sourcebook'', Elsevier (1990).
; String rewriting
* [[Ronald V. Book]] and Friedrich Otto, ''String-Rewriting Systems'', Springer (1993).
* Benjamin Benninghofen, Susanne Kemmerich and [[Michael M. Richter]], ''Systems of Reductions''. [[Lecture Notes in Computer Science|LNCS]] '''277''', Springer-Verlag (1987).
; Other
* [[Martin Davis (mathematician)|Martin Davis]], [[Ron Sigal]], [[Elaine J. Weyuker]], (1994) ''Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science – 2nd edition'', Academic Press, {{ISBN|0-12-206382-1}}.