ENGLISH

Rewriting Techniques and Applications: Dijon, France, May 20–22, 1985

By Bruno Buchberger (auth.) , Jean-Pierre Jouannaud (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1985
ISBN
9783540159766, 3540159762
DOI
10.1007/3-540-15976-2
Open Library ID
OL12772163M
Language
english
Format
DJVU
Filesize
4 MB (3761415 bytes)
Series
Lecture Notes in Computer Science 202
Edition
1
Pages
444\447
Topic
Computers
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26
Mathematical Logic and Formal Languages

Description

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.

Similar books