default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. 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. CLAAP 1980: 1-10 - Jean Berstel, Christophe Reutenauer:
Séries formelles reconnaissables d'arbres et applications. CLAAP 1980: 11-21 - Philippe Flajolet, Jean-Marc Steyaert:
On the analysis of tree-matching algorithms. CLAAP 1980: 22-40 - Dominique Gouyou-Beauchamps:
Sur un résultat récent de Laurent Chottin. CLAAP 1980: 41-44 - C. L. Liu:
Generation of trees. CLAAP 1980: 45-53 - Andrzej Wlodzimierz Mostowski:
Nearly deterministic automata acceptation of infinite trees and a complexity of weak theory of SkS. CLAAP 1980: 54-62 - Alberto Pettorossi:
Synthesis of subtree rewriting systems behaviour by solving equations. CLAAP 1980: 63-74 - Hagen Huwig, Axel Poigné:
A criterion common to various continuous completions of albegras and X-categories. CLAAP 1980: 75-82 - Bernard J. Robinet:
La programmaion fonctionnelle de Backus est-elle système de manipulation d'arbres? CLAAP 1980: 83-94 - Helmut Thiele:
On equivalent transformations of binary search trees. CLAAP 1980: 95-109 - Egidio Astesiano, Gerardo Costa:
Delayed evaluation trees and their application to sementics. CLAAP 1980: 110-118 - Norbert Cot:
Quelques propriétés des arbres penchés récursifs. CLAAP 1980: 119-129 - Werner Damm, Elfriede Fehr:
A schematalogical approach to the alalysis of the procedure concept in algol-languages. CLAAP 1980: 130-134 - Jocelyne Mongy:
Closure of recognisable tree-languages under intersection and morphisms. CLAAP 1980: 135-149 - A. Pink:
The data type ent and related operations in a linguistically oriented programming language. CLAAP 1980: 150-159 - Manfred Broy, Martin Wirsing:
Programming languages as abstract data types. CLAAP 1980: 160-177 - Gisbert Dittrich, Wolfgang Merzenich:
Unfolding Omega nets into trees (Résumé). CLAAP 1980: 178-179 - Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes (Résumé). CLAAP 1980: 180-181 - Didier Bégay, Laurent Kott:
Preuves de programmes sans induction. CLAAP 1980: 182-198 - Egidio Astesiano, Gerardo Costa:
Delayed evaluation trees and their application to sementics (Additif). CLAAP 1980: 199 - Gisbert Dittrich, Wolfgang Merzenich:
Unfolding Omega nets into trees. CLAAP 1980: 200-207 - Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes. CLAAP 1980: 208-224 - Marek Karpinski:
On global word definability and constructively definable sets in Nn. CLAAP 1980: 225-227 - Andrzej Wlodzimierz Mostowski:
Finite automata on infinite trees and subtheories of SkS. CLAAP 1980: 228-240 - S. Gill Williamson:
L'arbre des cycles d'un graphe. CLAAP 1980: 241-261
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-23 23:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
