Trees in algebra and programming - CAAP '94. 19th international colloquium, Edinburgh, GB, April 11--13, 1994. Proceedings (Q1320417)

The articles of mathematical interest will be reviewed individually. The 21st colloquium 1996 has been reviewed (see Zbl 0895.00061). Publisher's description: 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. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers. Indexed articles: \textit{Comon, H.; Treinen, R.}, Ordering constraints on trees, 1-14 [Zbl 0938.68589] \textit{Engelfriet, J.}, Graph grammars and tree transducers, 15-36 [Zbl 0938.68681] \textit{Alessi, F.}, Type preorders, 37-51 [Zbl 0938.03025] \textit{Bruscoli, Paola; Levi, Francesca; Levi, Giorgio; Meo, Maria Chiara}, Compilative constructive negation in constraint logic programs, 52-67 [Zbl 0938.68571] \textit{Cournier, A.; Habib, M.}, A new linear algorithm for modular decomposition, 68-84 [Zbl 0938.05502] \textit{de Groote, P.}, A CPS-translation of the \(\lambda\mu\)-calculus, 85-99 [Zbl 0938.03024] \textit{Drewes, F.}, A lower bound on the growth of functions computed by tree transductions, 100-114 [Zbl 0938.68975] \textit{Esparza, J.}, On the decidability of model checking for several \(\mu\)-calculi and Petri nets, 115-129 [Zbl 0938.03537] \textit{Giancarlo, R.; Mignosi, F.}, Generalizations of the periodicity theorem of Fine and Wilf, 130-141 [Zbl 0938.68765] \textit{Heckmann, R.}, Probabilistic domains, 142-156 [Zbl 0938.68716] \textit{Hofbauer, D.; Huber, M.; Kucherov, G.}, Some results on top-context-free tree languages, 157-171 [Zbl 0938.68703] \textit{Khasidashvili, Z.}, On higher order recursive program schemes, 172-186 [Zbl 0938.68643] \textit{Klarlund, N.; Schwartzbach, M. I.}, Graphs and decidable transductions based on edge constraints, 187-201 [Zbl 0938.68682] \textit{Kuske, D.}, Nondeterministic automata with concurrency relations and domains, 202-217 [Zbl 0938.68743] \textit{Merlini, D.; Sprugnoli, R.; Verri, M. C.}, Algebraic and combinatorial properties of simple, coloured walks, 218-233 [Zbl 0938.05500] \textit{Métivier, Y.; Saheb, N.}, Probabilistic analysis of an election algorithm in a tree, 234-245 [Zbl 0938.68653] \textit{Noll, T.}, On the first-order equivalence of call-by-name and call-by-value, 246-260 [Zbl 0938.68644] \textit{Ohlebusch, E.}, On the modularity of confluence of constructor-sharing term rewriting systems, 261-275 [Zbl 0938.68683] \textit{Palsberg, J.}, Global program analysis in constraint form, 276-290 [Zbl 0938.68719] \textit{Peled, D.}, On projective and separable properties, 291-307 [Zbl 0938.68702] \textit{Rambow, O.; Satta, G.}, A rank hierarchy for deterministic tree-walking transducers, 308-321 [Zbl 0938.68701] \textit{Ratoandromanana, B.; Robilliard, D.}, Superposition in picture languages, 322-334 [Zbl 0938.68704] \textit{Sørensen, M. H.}, A grammar-based data-flow analysis to stop deforestation, 335-351 [Zbl 0938.68575]