Advertisement

Table of contents

  1. Front Matter
  2. J. R. Kennaway, J. W. Klop, M. R. Sleep, F. J. de Vries
    Pages 1-12
  3. William M. Farmer, Ronald J. Watro
    Pages 13-24
  4. Frank Drewes, Clemens Lautemann
    Pages 49-61
  5. Stefan Krischer, Alexander Bockmayr
    Pages 74-85
  6. Jacques Chabin, Pierre Réty
    Pages 112-123
  7. Wayne Snyder, Christopher Lynch
    Pages 150-161
  8. Hélène Kirchner
    Pages 174-187
  9. Aart Middeldorp, Yoshihito Toyama
    Pages 188-199
  10. Tobias Nipkow, Zhenyu Qian
    Pages 200-214
  11. Pierre-Louis Curien, Giorgio Ghelli
    Pages 215-225
  12. Françoise Bellegarde
    Pages 226-239
  13. Dave Cohen, Phil Watson
    Pages 240-251
  14. Sieger van Denneheuvel, Karen Kwast, Gerard R. Renardel de Lavalette, Edith Spaan
    Pages 252-263
  15. J-L. Coquidé, M. Dauchet, R. Gilleron, S. Vàgvölgyi
    Pages 287-298
  16. Albert Gräf
    Pages 323-334
  17. Maria Paola Bonacina, Jieh Hsiang
    Pages 348-360
  18. Andrea Sattler-Klein
    Pages 374-385
  19. Claude Marché
    Pages 411-422
  20. Paliath Narendran, Michaël Rusinowitch
    Pages 423-434
  21. Ulrich Fraus, Heinrich Hußmann
    Pages 435-436
  22. Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie
    Pages 442-444
  23. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Pages 445-456
  24. Back Matter

About these proceedings

Introduction

This volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA-91), held in Como, Italy, April 10-12, 1991. The volume includes 40 papers on a wide variety of topics including: term rewriting systems, equational unification, algebraic rewriting, termination proofs, generalization problems, undecidable properties, parametrized specifications, normalizing systems, program transformation, query optimization, tree languages, graph languages, theorem proving systems, completion, graph rewriting systems, and open problems.

Keywords

Automatisches Schließen Beweissysteme Programmiersprache Rechnergestützte Entscheidung Term rewriting systems Verifikation optimization proving reasoning term rewriting theorem proving theorem proving systems verification

Bibliographic information

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