Table of contents

  1. Front Matter
  2. Christopher Lynch
    Pages 8-22
  3. Friedrich Otto, Masashi Katsura, Yuji Kobayashi
    Pages 53-67
  4. Evelyne Contejean, Claude Marché, Landy Rabehasaina
    Pages 98-112
  5. Leo Bachmair, Ashish Tiwari
    Pages 113-127
  6. Georg Struth
    Pages 128-141
  7. Thomas Arts, Jürgen Giesl
    Pages 157-171
  8. Nachum Dershowitz
    Pages 202-216
  9. Samuel M. H. W. Perlo-Freeman, Péter Prőhle
    Pages 217-227
  10. Yves Lafont
    Pages 228-229
  11. Denis Bechet, Philippe de Groote, Christian Retoré
    Pages 230-240

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, held in Sitges, Spain, in June 1997.
The 24 revised full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.

Keywords

Automatisches Schließen Constraint-Auflösung Monoid Stringersetzung Termersetzung Theorem-Beweisen algorithm algorithms automated deduction constraint solving programming programming language string rewriting term rewriting theorem proving

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-62950-5
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-62950-4
  • Online ISBN 978-3-540-69051-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book