Rewriting Techniques and Applications

9th International Conference, RTA-98 Tsukuba, Japan, March 30 – April 1, 1998 Proceedings

  • Editors
  • Tobias Nipkow
Conference proceedings RTA 1998

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1379)

Table of contents

  1. Front Matter
    Pages I-X
  2. J. W. Klop
    Pages 1-1
  3. Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
    Pages 32-46
  4. Manfred Schmidt-Schauß, Klaus U. Schulz
    Pages 61-75
  5. Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
    Pages 76-90
  6. Qing Guo, Paliath Narendran, Sandeep K. Shukla
    Pages 91-105
  7. Renate A. Schmidt
    Pages 106-120
  8. Sébastien Limet, Pierre Réty
    Pages 121-135
  9. Hubert Comon
    Pages 136-137
  10. Johannes Waldmann
    Pages 138-150
  11. Rakesh M. Verma, Michael Rusinowitch, Denis Lugiez
    Pages 166-180
  12. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
    Pages 181-195
  13. Witold Charatonik, Andreas Podelski
    Pages 211-225
  14. Thomas Arts, Jürgen Giesl
    Pages 226-240
  15. Claude Marché, Xavier Urbain
    Pages 241-255
  16. Takahito Aoto, Yoshihito Toyama
    Pages 256-270
  17. Olivier Danvy, Kristoffer HØgsbro Rose
    Pages 286-301
  18. Nachum Dershowitz, Ralf Treinen
    Pages 332-342
  19. Back Matter
    Pages 343-346

About these proceedings


This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.


Algorithms Automat Constraint Monoid Rack Resolution Variable algorithm functional programming lambda calculus logic programming proving theorem proving

Bibliographic information

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