5. CLAAP 1980:
Lille,
France
Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, Lilli, France, 21, 22 et 23 févier 1980.
Université de Lille 1 1980 
- Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations.
1-10
- Jean Berstel, Christophe Reutenauer:
Séries formelles reconnaissables d'arbres et applications.
11-21
- Philippe Flajolet, Jean-Marc Steyaert:
On the analysis of tree-matching algorithms.
22-40
- Dominique Gouyou-Beauchamps:
Sur un résultat récent de Laurent Chottin.
41-44
- C. L. Liu:
Generation of trees.
45-53
- Andrzej Wlodzimierz Mostowski:
Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkS.
54-62
- Alberto Pettorossi:
Synthesis of subtree rewriting systems behaviour by solving equations.
63-74
- Hagen Huwig, Axel Poigné:
A criterion common to various continuous completions of albegras and X-categories.
75-82
- Bernard Robinet:
La programmaion fonctionnelle de Backus est-elle système de manipulation d'arbres?
83-94
- Helmut Thiele:
On equivalent transformations of binary search trees.
95-109
- Egidio Astesiano, Gerardo Costa:
Delayed evaluation trees and their application to sementics.
110-118
- Norbert Cot:
Quelques propriétés des arbres penchés récursifs.
119-129
- Werner Damm, Elfriede Fehr:
A schematalogical approach to the alalysis of the procedure concept in algol-languages.
130-134
- Jocelyne Mongy:
Closure of recognisable tree-languages under intersection and morphisms.
135-149
- A. Pink:
The data type ent and related operations in a linguistically oriented programming language.
150-159
- Manfred Broy, Martin Wirsing:
Programming languages as abstract data types.
160-177
- Gisbert Dittrich, Wolfgang Merzenich:
Unfolding Omega nets into trees (Résumé).
178-179
- Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes (Résumé).
180-181
- Didier Bégay, Laurent Kott:
Preuves de programmes sans induction.
182-198
- Egidio Astesiano, Gerardo Costa:
Delayed evaluation trees and their application to sementics (Additif).
199
- Gisbert Dittrich, Wolfgang Merzenich:
Unfolding Omega nets into trees.
200-207
- Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes.
208-224
- Marek Karpinski:
On global word definability and constructively definable sets in Nn.
225-227
- Andrzej Wlodzimierz Mostowski:
Finite automata on infinite trees and subtheories of SkS.
228-240
- S. Gill Williamson:
L'arbre des cycles d'un graphe.
241-261
Copyright © Mon Nov 2 20:22:35 2009
by Michael Ley (ley@uni-trier.de)
