CAAP '88 | 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings

Max Dauchet (u. a.)

ISBN 10: 354019021X / ISBN 13: 9783540190219

Published by Springer, 1988

About this Item

CAAP '88 | 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings | Max Dauchet (u. a.) | Taschenbuch | viii | Englisch | 1988 | Springer | EAN 9783540190219 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 102145453

Bibliographic Details

• Title: CAAP '88 | 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings
• Publisher: Springer
• Publication Date: 1988
• Language: English
• ISBN 10: 354019021X
• ISBN 13: 9783540190219
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 18D millimeters 235 millimeters width by 155 millimeters height by 18 millimeters depth
• Weight: 482 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.