CAAP ’88: 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21–24, 1988 Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 299

ISBN: 354019021X, 9783540190219

Size: 3 MB (3311091 bytes)

Pages: 305/311

File format:

Language:

Publishing Year:

Category: Tag:

Jochen Burghardt (auth.), M. Dauchet, M. Nivat (eds.)354019021X, 9783540190219

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.

Table of contents :
A tree pattern matching algorithm with reasonable space requirements….Pages 1-15
On the maximum path length of AVL trees….Pages 16-27
Decomposition trees: Structured graph representation and efficient algorithms….Pages 28-39
On counting and approximation….Pages 40-51
Parameter-reduction of higher level grammars….Pages 52-71
Analysis of dynamic algorithms in D.E.Knuth’s model….Pages 72-88
On completeness of narrowing strategies….Pages 89-101
Implementing term rewrite languages in Dactl….Pages 102-116
Unification in primal algebras….Pages 117-131
Algebraic specification with built-in domain constructions….Pages 132-148
Product and iteration of module specifications….Pages 149-164
Equational completion in order-sorted algebras extended abstract….Pages 165-184
Proving systolic arrays….Pages 185-199
Expressiveness bounds for completeness in trace-based network proof systems….Pages 200-214
Proof systems for Hennessy-Milner Logic with recursion….Pages 215-230
Regular automata and model checking….Pages 231-243
Interval logics and sequential transducers….Pages 244-257
A 2 CCS: A simple extension of CCS for handling atomic actions….Pages 258-270
Modelling statecharts behaviour in a fully abstract way….Pages 271-294
Directed hypergraphs: Data structures and applications….Pages 295-303

Reviews

There are no reviews yet.

Be the first to review “CAAP ’88: 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21–24, 1988 Proceedings”
Shopping Cart
Scroll to Top