![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
19. CAAP 1994: Edinburgh, U.K.
- Sophie Tison
:
Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings. Lecture Notes in Computer Science 787, Springer 1994, ISBN 3-540-57879-X
Invited Papers
- Hubert Comon, Ralf Treinen:
Ordering Constraints on Trees. 1-14 - Joost Engelfriet:
Graph Grammars and Tree Transducers. 15-36
Contributed Papers
- Fabio Alessi:
Type Preorders. 37-51 - Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo
:
Compilative Constructive Negation in Constraint Logic Programs. 52-67 - Alain Cournier, Michel Habib:
A New Linear Algorithm for Modular Decomposition. 68-84 - Philippe de Groote:
A CPS-Translation of the Lambda-µ-Calculus. 85-99 - Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transductions. 100-114 - Javier Esparza
:
On the Decidability of Model Checking for Several µ-calculi and Petri Nets. 115-129 - Raffaele Giancarlo, Filippo Mignosi:
Generalizations of the Periodicity Theorem of Fine and Wilf. 130-141 - Reinhold Heckmann:
Probabilistic Domains. 142-156 - Dieter Hofbauer, Maria Huber, Gregory Kucherov:
Some Results on Top-Context-Free Tree Languages. 157-171 - Zurab Khasidashvili:
On Higher Order Recursive Program Schemes. 172-186 - Nils Klarlund, Michael I. Schwartzbach:
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). 187-201 - Dietrich Kuske:
Nondeterministic Automata with Concurrency Relations and Domains. 202-217 - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Algebraic and Combinatorial Properties of Simple, Coloured Walks. 218-233 - Yves Métivier, Nasser Saheb:
Probabilistic Analysis of an Election Algorithm in a Tree. 234-245 - Thomas Noll
:
On the First-Order Equivalence of Call-by-Name and Call-by-Value. 246-260 - Enno Ohlebusch:
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. 261-275 - Jens Palsberg:
Flobal Program Analysis in Constraint Form. 276-290 - Doron A. Peled:
On Projective and Separable Properties. 291-308 - Owen Rambow, Giorgio Satta
:
A Rank Hierarchy for Determinsitic Tree-Walking Transducers. 309-321 - Bodonirina Ratoandromanana, Denis Robilliard:
Superposition in Picture Languages. 322-334 - Morten Heine Sørensen:
Grammar-Based Data-Flow Analysis to Stop Deforestation. 335-351
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.