Advertisement

Table of contents

  1. Front Matter
  2. Stefan Kahrs
    Pages 21-35
  3. Kristoffer Høgsbro Rose
    Pages 36-50
  4. Valentin Antimirov, Anatoli Degtyarev
    Pages 67-81
  5. Carlos Loria-Saenz, Joachim Steinbach
    Pages 143-147
  6. H. Zantema
    Pages 148-154
  7. Nachum Dershowitz, Subrata Mitra
    Pages 168-174
  8. Peter Padawitz
    Pages 175-197
  9. Harald Ganzinger, Jürgen Stuber
    Pages 226-241
  10. Francois Bronsard, Uday S. Reddy
    Pages 242-256
  11. David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee
    Pages 257-271
  12. Dieter Hofbauer, Maria Huber
    Pages 287-301
  13. Hantao Zhang
    Pages 302-306
  14. Nachum Dershowitz
    Pages 307-314
  15. Sergei G. Vorobyov
    Pages 315-327
  16. Yabo Wang, David Lorge Parnas
    Pages 343-356
  17. Hantao Zhang
    Pages 363-377
  18. Leszek Pacholski
    Pages 429-429
  19. Paola Inverardi, Monica Nesi
    Pages 458-467
  20. Alexander Bockmayr, Stefan Krischer, Andreas Werner
    Pages 483-497
  21. Wenchang Fang, Jung-Hong Kao
    Pages 498-501
  22. Back Matter

About these proceedings

Introduction

This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively.

Keywords

Automat automated deduction programming programming language proving semantics theorem proving

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-56393-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56393-8
  • Online ISBN 978-3-540-47549-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site