This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …

Term rewriting techniques are applicable to various fields of computer science, including
software engineering, programming languages, computer algebra, program verification …

Conditional rewriting is universally recognized as being much more complicated than
unconditional rewriting. In this paper we study how much of conditional rewriting can be …

Termination and confluence properties of term rewriting systems are of fundamental
importance, both from a theoretical point of view and also concerning many practical …

A property P of term rewriting systems TRSs, for short is said to be persistent if for any many-
sorted TRS R, R has the property P if and only if its underlying unsorted TRS R has the …

We present a procedure for transforming strongly sequential constructor-based term
rewriting systems (TRSs) into context-sensitive TRSs in such a way that productivity of the …

Currying is a transformation of term rewrite systems which may contain symbols of arbitrary
arity into systems which contain only nullary symbols, together with a single binary symbol …

Context-sensitive rewriting (CSR) has recently emerged as an interesting and flexible
paradigm that provides a bridge between the abstract world of general rewriting and the …

This paper argues that the core of modularity problems is an understanding of how
individual components of a large system interact with each other, and that this interaction …

The framework of dependency pairs allows automated termination and innermost
termination proofs for many TRSs where such proofs were not possible before. In this paper …