TAPSOFT '91. Proceedings of the international joint conference on theory and practice of software development, Brighton, GB, April 8-12, 1991. Vol. 1: Colloquium on trees in algebra and programming (CAAP '91) (Q1202092)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Aceto, Luca}, Full abstraction for series-parallel pomsets, 1-25 [Zbl 0967.68517] \textit{Ferrari, Gian Luigi; Montanari, Ugo; Mowbray, Miranda}, On causality observed incrementally, finally, 26-41 [Zbl 0967.68519] \textit{Kwiatkowska, Marta Z.}, On the domain of traces and sequential composition, 42-56 [Zbl 0967.68527] \textit{Kounalis, E.; Lugiez, D.}, Compilation of pattern matching with associative-commutative functions, 57-73 [Zbl 0967.68505] \textit{Caron, A.-C.}, Linear bounded automata and rewrite systems: influence of initial configurations on decision properties, 74-89 [Zbl 0967.68523] \textit{van den Broek, P. M.}, Algebraic graph rewriting using a single pushout, 90-102 [Zbl 0967.68522] \textit{Baumeister, Hubert}, Unifying initial and loose semantics of parameterized specifications in an arbitrary institution, 103-120 [Zbl 0967.68533] \textit{Astesiano, Egidio; Cerioli, Maura}, Nonstrict and don't care algebras and specifications, 121-142 [Zbl 0967.68529] \textit{Luo, Zhaohui}, Program specification and data refinement in type theory, 143-168 [Zbl 0967.68530] \textit{Granger, Philippe}, Static analysis of linear congruence equalities among variables of a program, 169-192 [Zbl 0967.68509] \textit{Luccio, Fabrizio; Pagli, Linda}, Simple solutions for approximate tree matching problems, 193-201 [Zbl 0967.68535] \textit{Kilpeläinen, Pekka; Mannila, Heikki}, The tree inclusion problem, 202-214 [Zbl 0967.68536] \textit{Kasangian, S.; Vigna, S.}, Introducing a calculus of trees, 215-240 [Zbl 0967.68534] \textit{Amadio, Roberto M.}, Domains in a realizability framework, 241-263 [Zbl 0967.68510] \textit{Corradini, Andrea; Rossi, Francesca; Parisi-Presicce, Francesco}, Logic programming as hypergraph rewriting, 275-295 [Zbl 0967.68507] \textit{de Boer, Frank S.; Palamidessi, Catuscia}, A fully abstract model for concurrent constraint programming, 296-319 [Zbl 0967.68516] \textit{Gabbrielli, Maurizio; Levi, Giorgio}, A solved form algorithm for ask and tell Herbrand constraints, 320-337 [Zbl 0967.68506] \textit{Najm, Elie; Stefani, Jean-Bernard}, Object-based concurrency: A process calculus analysis, 359-380 [Zbl 0967.68518] \textit{Jonsson, Bengt; Larsen, Kim Guldstrand}, On the complexity of equation solving in process algebra, 381-396 [Zbl 0967.68514] \textit{van Breugel, Franck}, Comparative semantics for a real-time programming language with integration, 397-411 [Zbl 0967.68526] \textit{Ortega-Mallén, Yolanda; de Frutos-Escrig, David}, A complete proof system for timed observations, 412-440 [Zbl 0967.68512] \textit{Schwartzbach, Michael I.}, Type inference with inequalities, 441-455 [Zbl 0967.68528]