4. TAPSOFT 1991: Brighton, UK

->Volume 2

Samson Abramsky, T. S. E. Maibaum (Eds.): TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91). Lecture Notes in Computer Science 493 Springer 1991, ISBN 3-540-53982-4

CAAP Colloquium on Trees in Algebra and Programming

• Luca Aceto:
  Full Abstraction for Series-Parallel Pomsets. 1-25
  
• Gian Luigi Ferrari:
  On Causality Observed Incrementally, Finally. 26-41
  
• Marta Z. Kwiatkowska:
  On the Domain of Traces and Sequential Composition. 42-56
  
• Emmanuel Kounalis, Denis Lugiez:
  Compilation of Pattern Matching with Associative-Commutative Functions. 57-73
  
• Anne-Cécile Caron:
  Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. 74-89
  
• P. M. van den Broek:
  Algebraic Graph Rewriting Using a Single Pushout. 90-102
  
• Hubert Baumeister:
  Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. 103-120
  
• Egidio Astesiano, Maura Cerioli:
  Non-Strict Don't Care Algebras and Specifications. 121-142
  
• Zhaohui Luo:
  Program Specification and Data Refinement in Type Theory. 143-168
  
• Philippe Granger:
  Static Analysis of Linear Congruence Equalities among Variables of a Program. 169-192
  
• Fabrizio Luccio, Linda Pagli:
  Simple Solutions for Approximate Tree Matching Problems. 193-201
  
• Pekka Kilpeläinen, Heikki Mannila:
  The Tree Inclusion Problem. 202-214
  
• Stefano Kasangian, Sebastiano Vigna:
  Introducing a Calculus of Trees. 215-240
  
• Roberto M. Amadio:
  Domains in a Realizability Framework. 241-263
  
• Stephen L. Bloom, Zoltán Ésik:
  Iteration Algebras (Extended Abstract). 264-274
  
• Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce:
  Logic Programming as Hypergraph Rewriting. 275-295
  
• Frank S. de Boer, Catuscia Palamidessi:
  A Fully Abstract Model for Concurrent Constraint Programming. 296-319
  
• Maurizio Gabbrielli, Giorgio Levi:
  A Solved Form Algorithm for Ask and Tell Herbrand Constraints. 320-337
  
• K. V. S. Prasad:
  A Calculus of Broadcasting Systems. 338-358
  
• Elie Najm, Jean-Bernard Stefani:
  Object-Based Concurrency: A Process Calculus Analysis. 359-380
  
• Bengt Jonsson, Kim Guldstrand Larsen:
  On the Complexity of Equation Solving in Process Algebra. 381-396
  
• Franck van Breugel:
  Comparative Semantics for a Real-Time Programming Language with Integration. 397-411
  
• Yolanda Ortega-Mallén, David de Frutos-Escrig:
  A Complete Proof System for Timed Observations. 412-440
  
• Michael I. Schwartzbach:
  Type Inference with Inequalities. 441-455