Summary: Transforming Context­Sensitive Rewrite
Systems ?
J¨urgen Giesl 1 and Aart Middeldorp 2
1 Dept. of Computer Science, Darmstadt University of Technology
Alexanderstr. 10, 64283 Darmstadt, Germany
giesl@informatik.tu­darmstadt.de
2 Institute of Information Sciences and Electronics
University of Tsukuba, Tsukuba 305­8573, Japan
ami@is.tsukuba.ac.jp
Abstract. We present two new transformation techniques for proving
termination of context­sensitive rewriting. Our first method is simple,
sound, and more powerful than previously suggested transformations.
However, it is not complete, i.e., there are terminating context­sensitive
rewrite systems that are transformed into non­terminating term rewrite
systems. The second method that we present in this paper is both sound
and complete. This latter result can be interpreted as stating that from
a termination perspective there is no reason to study context­sensitive
rewriting.
1 Introduction
In the presence of infinite reductions in term rewriting, the search for normal

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences