Conferences in DBLP

Colloquium on Trees in Algebra and Programming (CAAP) (caap)
1996 (conf/caap/1996)

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