19. CAAP 1994:
Edinburgh, U.K.
Sophie Tison (Ed.):
Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, U.K., April 11-13, 1994, Proceedings.
Lecture Notes in Computer Science 787 Springer 1994, ISBN 3-540-57879-X BibTeX
@proceedings{DBLP:conf/caap/1994,
editor = {Sophie Tison},
title = {Trees in Algebra and Programming - CAAP'94, 19th International
Colloquium, Edinburgh, U.K., April 11-13, 1994, Proceedings},
booktitle = {CAAP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {787},
year = {1994},
isbn = {3-540-57879-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Contributed Papers
- Fabio Alessi:
Type Preorders.
37-51 BibTeX
- Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo:
Compilative Constructive Negation in Constraint Logic Programs.
52-67 BibTeX
- Alain Cournier, Michel Habib:
A New Linear Algorithm for Modular Decomposition.
68-84 BibTeX
- Philippe de Groote:
A CPS-Translation of the Lambda-µ-Calculus.
85-99 BibTeX
- Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transductions.
100-114 BibTeX
- Javier Esparza:
On the Decidability of Model Checking for Several µ-calculi and Petri Nets.
115-129 BibTeX
- Raffaele Giancarlo, Filippo Mignosi:
Generalizations of the Periodicity Theorem of Fine and Wilf.
130-141 BibTeX
- Reinhold Heckmann:
Probabilistic Domains.
142-156 BibTeX
- Dieter Hofbauer, Maria Huber, Gregory Kucherov:
Some Results on Top-Context-Free Tree Languages.
157-171 BibTeX
- Zurab Khasidashvili:
On Higher Order Recursive Program Schemes.
172-186 BibTeX
- Nils Klarlund, Michael I. Schwartzbach:
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract).
187-201 BibTeX
- Dietrich Kuske:
Nondeterministic Automata with Concurrency Relations and Domains.
202-217 BibTeX
- Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Algebraic and Combinatorial Properties of Simple, Coloured Walks.
218-233 BibTeX
- Yves Métivier, Nasser Saheb:
Probabilistic Analysis of an Election Algorithm in a Tree.
234-245 BibTeX
- Thomas Noll:
On the First-Order Equivalence of Call-by-Name and Call-by-Value.
246-260 BibTeX
- Enno Ohlebusch:
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems.
261-275 BibTeX
- Jens Palsberg:
Flobal Program Analysis in Constraint Form.
276-290 BibTeX
- Doron Peled:
On Projective and Separable Properties.
291-308 BibTeX
- Owen Rambow, Giorgio Satta:
A Rank Hierarchy for Determinsitic Tree-Walking Transducers.
309-321 BibTeX
- Bodonirina Ratoandromanana, Denis Robilliard:
Superposition in Picture Languages.
322-334 BibTeX
- Morten Heine Sørensen:
Grammar-Based Data-Flow Analysis to Stop Deforestation.
335-351 BibTeX
Copyright © Sat May 16 23:00:03 2009
by Michael Ley (ley@uni-trier.de)
