Table of contents

  1. Front Matter
  2. Rolf Klein, Derick Wood
    Pages 16-27
  3. Johannes Köbler, Uwe Schöning, Jacobo Toran
    Pages 40-51
  4. J. Françon, B. Randrianarimanana, R. Schott
    Pages 72-88
  5. Rachid Echahed
    Pages 89-101
  6. J. R. Kennaway
    Pages 102-116
  7. Tobias Nipkow
    Pages 117-131
  8. Bernhard Möller, Andrzej Tarlecki, Martin Wirsing
    Pages 132-148
  9. Francesco Parisi-Presicce
    Pages 149-164
  10. Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner
    Pages 165-184
  11. E. Pascal Gribomont
    Pages 185-199
  12. Jennifer Widom, Prakash Panangaden
    Pages 200-214
  13. Z. Habasiński
    Pages 231-243
  14. Max Michel, Jean-Bernard Stefani
    Pages 244-257
  15. Roberto Gorrieri, Sergio Marchetti, Ugo Montanari
    Pages 258-270
  16. C. Huizing, R. Gerth, W. P. de Roever
    Pages 271-294
  17. Back Matter

About these proceedings


This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.


Algorithms Analysis Automat algorithm automata complexity computer computer science data structure data structures logic model checking programming term rewriting

Bibliographic information

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