Table of contents

  1. Front Matter
  2. Timothy B. Baird, Gerald E Peterson, Ralph W. Wilkerson
    Pages 29-44
  3. Hubert Bertling, Harald Ganzinger
    Pages 45-58
  4. Reinhard Bündgen, Wolfgang Küchlin
    Pages 59-75
  5. Stephen J. Garland, John V. Guttag
    Pages 137-151
  6. Dieter Hofbauer, Clemens Lautemann
    Pages 167-177
  7. Stéphane Kaplan, Christine Choppy
    Pages 178-186
  8. Dana May Latch, Ron Sigal
    Pages 222-233
  9. George F. McNulty
    Pages 234-262

About these proceedings


Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculus. Applications cover broad areas in automated reasoning, programming language design, semantics, and implementations, and symbolic and algebraic manipulation. The proceedings of the third International Conference on Rewriting Techniques and Applications contain 34 regular papers, covering many diverse aspects of rewriting (including equational logic, decidability questions, term rewriting, congruence-class rewriting, string rewriting, conditional rewriting, graph rewriting, functional and logic programming languages, lazy and parallel implementations, termination issues, compilation techniques, completion procedures, unification and matching algorithms, deductive and inductive theorem proving, Gröbner bases, and program synthesis). It also contains 12 descriptions of implemented equational reasoning systems. Anyone interested in the latest advances in this fast growing area should read this volume.


Automat algorithm algorithms automated deduction automated reasoning lambda calculus logic programming programming language proving semantics term rewriting theorem proving

Bibliographic information

Industry Sectors
Finance, Business & Banking