21. CAAP 1996: Linköping, Sweden

• Samson Abramsky:
  Semantics of Interaction (Abstract). 1
  
• Anne Bottreau, Yves Métivier:
  The Kronecker Product and Local Computations in Graphs. 2-16
  
• Marina Madonia, Stefano Varricchio:
  Iterative Pairs and Multitape Automata. 17-29
  
• Alexandre Boudet, Hubert Comon:
  Diophantine Equations, Presburger Arithmetic and Finite Automata. 30-43
  
• Armin Kühnemann:
  A Pumping Lemma for Output Languages of Macro Tree Transducers. 44-58
  
• Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
  The Area Determined by Underdiagonal Lattice Paths. 59-71
  
• Yukihide Takayama:
  Extraction of Concurrent Processes from Higher Dimensional Automata. 72-86
  
• Roope Kaivola:
  Axiomatising Extended Computation Tree Logic. 87-101
  
• Marina Lenisa:
  Final Semantics for a Higher Order Concurrent Language. 102-118
  
• Frank Pfenning:
  The Practice of Logical Frameworks. 119-134
  
• Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan:
  Subsumption Algorithms Based on Search Trees. 135-148
  
• Maribel Fernández, Ian Mackie:
  Interaction Nets and Term Rewriting Systems (Extended Abstract). 149-164
  
• Björn Lisper:
  Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations. 165-179
  
• John R. W. Glauert, Zurab Khasidashvili:
  Relative Normalization in Deterministic Residual Structures. 180-195
  
• Thomas Arts:
  Termination by Absence of Infinite Chains of Dependency Pairs. 196-210
  
• Bernhard Gramlich:
  Confluence without Termination via Parallel Critical Pairs. 211-225
  
• E. A. Cichon, Hélène Touzet:
  An Ordinal Calculus for Proving Termination in Term Rewriting. 226-240
  
• Michel Bidoit, Andrzej Tarlecki:
  Behavioural Satisfaction and Equivalence in Concrete Model Categories. 241-256
  
• Allan Cheng, Mogens Nielsen:
  Open Maps, Behavioural Equivalences, and Congruences. 257-271
  
• Arend Rensink:
  Denotational, Causal, and Operational Determinism in Event Structures. 272-286
  
• Morten Heine Sørensen:
  Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi. 287-301
  
• Gérard Boudol, Carolina Lavatelli:
  Full Abstraction for Lambda Calculus with Resources and Convergence Testing. 302-316
  
• Jerzy Tiuryn, Mitchell Wand:
  Untyped Lambda-Calculus with Input-Output. 317-329