TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991

The proceedings of TAPSOFT '91 are organized into three parts: Colloquium on Trees in Algebra and Programming (CAAP), contained in Vol. 1, and Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD), both contained in Vol. 2. The proceedings are published in two volumes.

Inhalt
Full abstraction for series-parallel pomsets.- On causality observed incrementally, finally.- On the domain of traces and sequential composition.- Compilation of pattern matching with associative-commutative functions.- Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties.- Algebraic graph rewriting using a single pushout.- Unifying initial and loose semantics of parameterized specifications in an arbitrary institution.- Non-strict don't care algebras and specifications.- Program specification and data refinement in type theory.- Static analysis of linear congruence equalities among variables of a program.- Simple solutions for approximate tree matching problems.- The tree inclusion problem.- Introducing a calculus of trees.- Domains in a realizability framework.- Iteration algebras extended abstract.- Logic programming as hypergraph Rewriting.- A fully abstract model for concurrent constraint programming.- A solved form algorithm for ask and tell Herbrand constraints.- A calculus of broadcasting systems.- Object-based concurrency : A process calculus analysis.- On the complexity of equation solving in process algebra.- Comparative semantics for a real-time programming language with integration.- A complete proof system for timed observations.- Type inference with inequalities.