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
  10. Chilukuri K. Mohan, Mandayam K. Srivas
    Pages 292-310
  11. Tohru Naoi, Yasuyoshi Inagaki
    Pages 311-325
  12. Uday S. Reddy
    Pages 388-403
  13. Wayne Snyder
    Pages 419-433
  14. Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
    Pages 477-491
  15. Hantao Zhang, Deepak Kapur
    Pages 513-527
  16. Habib Abdulrab, Jean-Pierre Pécuchet
    Pages 529-532
  17. Siva Anantharaman, Jieh Hsiang, Jalel Mzali
    Pages 533-537
  18. J. Avenhaus, J. Denzinger, J. Müller
    Pages 538-541
  19. Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach
    Pages 542-546
  20. Michel Bidoit, Francis Capy, Christine Choppy
    Pages 547-547
  21. Maria Paola Bonacina, Giancarlo Sanna
    Pages 548-550
  22. Jim Christian
    Pages 551-555
  23. Deepak Kapur, Hantao Zhang
    Pages 559-563
  24. H. Khoshnevisan, K. M. Sephton
    Pages 564-568
  25. Naomi Lindenstrauss
    Pages 569-573
  26. John Pedersen
    Pages 574-578
  27. Back Matter

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

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51081-9
  • Online ISBN 978-3-540-46149-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site