The theory and practice of term rewriting is now well-established and the focus of growing interest in the world of computer science. This book brings together a collection of original research contributions and surveys of existing knowledge. Some of the most significant developments in term rewriting theory are reviewed, as well as a history of the most important discovery in the field, namely the notion of a critical pair and its natural consequence, the completion algorithm. Many of the new ideas developed have important applications in other fields of theoretical computing. Therefore, this book should be of interest to researchers from areas such as logic programming, computer algebra, and functional programming.

Скачать книгу бесплатно (djvu, 3.59 Mb)

---

Читать «Rewriting Techniques and Applications, 1 conf., RTA-85»