This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994.

Ordering constraints on trees.- Graph grammars and tree transducers.- Type Preorders.- Compilative constructive negation in constraint logic programs.- A new linear algorithm for Modular Decomposition.- A CPS-translation of the ??-calculus.- A lower bound on the growth of functions computed by tree transductions.- On the decidability of model checking for several ?-calculi and Petri nets.- Generalizations of the periodicity theorem of Fine and Wilf.- Probabilistic domains.- Some results on top-context-free tree languages.- On higher order recursive program schemes.- Graphs and decidable transductions based on edge constraints.- Nondeterministic automata with concurrency relations and domains.- Algebraic and combinatorial properties of simple, coloured walks.- Probabilistic analysis of an election algorithm in a tree.- On the first-order equivalence of call-by-name and call-by-value.- On the modularity of confluence of constructor-sharing term rewriting systems.- Global program analysis in constraint form.- On projective and separable properties.- A rank hierarchy for deterministic tree-walking transducers.- Superposition in picture languages.- A grammar-based data-flow analysis to stop deforestation.

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com