CAAP '88 : 13th Colloquium on trees in algebra and programming, Nancy, France, March 21-24, 1988 : 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 Conferenc...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
299 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CAAP '88, proceedings, 13th Colloquium on trees in algebra and programming, Nancy, France, March 21-24, 1988, Berlin, Springer-Verlag, 1988, 1 vol. (VIII-303 p.), Lecture notes in computer science, 3-540-19021-X • CAAP '88, Texte imprimé, 9783662214947 |
جدول المحتويات:
- 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.