UID:
edocfu_9959186270002883
Format:
1 online resource (VIII, 305 p.)
Edition:
1st ed. 1988.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-38930-X
Series Statement:
Lecture Notes in Computer Science, 299
Content:
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.
Note:
Bibliographic Level Mode of Issuance: Monograph
,
A tree pattern matching algorithm with reasonable space requirements -- On the maximum path length of AVL trees -- Decomposition trees: Structured graph representation and efficient algorithms -- On counting and approximation -- Parameter-reduction of higher level grammars -- Analysis of dynamic algorithms in D.E.Knuth's model -- On completeness of narrowing strategies -- Implementing term rewrite languages in Dactl -- Unification in primal algebras -- Algebraic specification with built-in domain constructions -- Product and iteration of module specifications -- Equational completion in order-sorted algebras extended abstract -- Proving systolic arrays -- Expressiveness bounds for completeness in trace-based network proof systems -- Proof systems for Hennessy-Milner Logic with recursion -- Regular automata and model checking -- Interval logics and sequential transducers -- A2CCS: A simple extension of CCS for handling atomic actions -- Modelling statecharts behaviour in a fully abstract way -- Directed hypergraphs: Data structures and applications.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-19021-X
Language:
English
URL:
http://dx.doi.org/10.1007/BFb0026091
