15. CAAP 1990: Copenhagen, Denmark

André Arnold (Ed.): CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 431 Springer 1990, ISBN 3-540-52590-4 BibTeX

@proceedings{DBLP:conf/caap/1990,
  editor    = {Andr{\'e} Arnold},
  title     = {CAAP '90, 15th Colloquium on Trees in Algebra and Programming,
               Copenhagen, Denmark, May 15-18, 1990, Proceedings},
  booktitle = {CAAP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {431},
  year      = {1990},
  isbn      = {3-540-52590-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Tirza Hirst, David Harel: On the Power of Bounded Concurrency II: The Pushdown Automata Level. 1-17 BibTeX
Xavier Gérard Viennot: Trees Everywhere. 18-41 BibTeX
Marco Bellia, Michele Bugliesi, M. Eugenia Occhiuto: Combinatory Forms for Equational Programming: Instances, Unification and Narrowing. 42-56 BibTeX
Gérard Boudol, Kim Guldstrand Larsen: Graphical versus Logical Specifications. 57-71 BibTeX
Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Tree Pattern Matching. 72-86 BibTeX
Didier Caucal: On the Regular Structure of Prefix Rewriting. 87-102 BibTeX
Edmund M. Clarke, Anca Browne, Robert P. Kurshan: A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata. 103-116 BibTeX
Maxime Crochemore, Jean Neraud: Unitary Monoid with Two Generators: An Algorithmic Point of View. 117-131 BibTeX
Pierre-Louis Curien, Giorgio Ghelli: Coherence of Subsumption. 132-146 BibTeX
Uffe Engberg, Glynn Winskel: Petri Nets as Models of Linear Logic. 147-161 BibTeX
Gian Luigi Ferrari, Ugo Montanari: Towards the Unification of Models for Concurrency. 162-176 BibTeX
Dominique Geniet, René Schott, Loÿs Thimonier: A Markovian Concurrency Measure. 177-190 BibTeX
Kristoffer Høgsbro Holm: Graph Matching in Operational Semantics and Typing. 191-205 BibTeX
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: ML Typability is DEXTIME-Complete. 206-220 BibTeX
Emmanuel Kounalis: Testing for Inductive (Co)-Reducibility. 221-238 BibTeX
Guy Louchard, René Schott: Probabilistic Analysis of Some Distributed Algorithms. 239-253 BibTeX
Michael I. Schwartzbach: Infinite Values in Hierarchical Imperative Types. 254-268 BibTeX
Helmut Seidl: Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. 269-284 BibTeX