Abstract is missing.
- On the Power of Bounded Concurrency II: The Pushdown Automata LevelTirza Hirst, David Harel. 1-17
- Trees EverywhereXavier Gérard Viennot. 18-41
- Combinatory Forms for Equational Programming: Instances, Unification and NarrowingMarco Bellia, Michele Bugliesi, M. Eugenia Occhiuto. 42-56
- Graphical versus Logical SpecificationsGérard Boudol, Kim Guldstrand Larsen. 57-71
- More Efficient Bottom-Up Tree Pattern MatchingJiazhen Cai, Robert Paige, Robert Endre Tarjan. 72-86
- On the Regular Structure of Prefix RewritingDidier Caucal. 87-102
- A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-AutomataEdmund M. Clarke, Anca Browne, Robert P. Kurshan. 103-116
- Unitary Monoid with Two Generators: An Algorithmic Point of ViewMaxime Crochemore, Jean Neraud. 117-131
- Coherence of SubsumptionPierre-Louis Curien, Giorgio Ghelli. 132-146
- Petri Nets as Models of Linear LogicUffe Engberg, Glynn Winskel. 147-161
- Towards the Unification of Models for ConcurrencyGian Luigi Ferrari, Ugo Montanari. 162-176
- A Markovian Concurrency MeasureDominique Geniet, René Schott, Loÿs Thimonier. 177-190
- Graph Matching in Operational Semantics and TypingKristoffer Høgsbro Holm. 191-205
- ML Typability is DEXTIME-CompleteA. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. 206-220
- Testing for Inductive (Co)-ReducibilityEmmanuel Kounalis. 221-238
- Probabilistic Analysis of Some Distributed AlgorithmsGuy Louchard, René Schott. 239-253
- Infinite Values in Hierarchical Imperative TypesMichael I. Schwartzbach. 254-268
- Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is DecidableHelmut Seidl. 269-284