21. CAAP 1996: Linköping, Sweden

Hélène Kirchner (Ed.): Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings. Lecture Notes in Computer Science 1059 Springer 1996, ISBN 3-540-61064-2 BibTeX

@proceedings{DBLP:conf/caap/1996,
  editor    = {H{\'e}l{\`e}ne Kirchner},
  title     = {Trees in Algebra and Programming - CAAP'96, 21st International
               Colloquium, Link{\"o}ping, Sweden, April, 22-24, 1996, Proceedings},
  booktitle = {CAAP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1059},
  year      = {1996},
  isbn      = {3-540-61064-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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