15. CAAP 1990: Copenhagen, Denmark

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