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