Conferences in DBLP

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

1. Eric G. Wagner
   A Categorical Treatment of Pre- and Post Conditions. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:1-5 [Conf]
   
2. Robert Cori, Serge Dulucq
   Colourings of Planar Maps and the Equality of Two Languages. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:6-16 [Conf]
   
3. Joffroy Beauquier, Béatrice Bérard
   On the Equivalence of Synchronization Sets. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:17-29 [Conf]
   
4. Francesco Parisi-Presicce
   Inner and Mutual Compatibility of Basic Operations on Module Specifications. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:30-44 [Conf]
   
5. Alex Pelin, Jean H. Gallier
   Exact Computation Sequences. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:45-59 [Conf]
   
6. Gheorghe Stefanescu
   An Algebraic Theory of Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:60-73 [Conf]
   
7. Michel Bauderon, Bruno Courcelle
   An Algebraic Formalism for Graphs. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:74-84 [Conf]
   
8. Elias Dahlhaus, Manfred K. Warmuth
   Membership for Growing Context Sensitive Grammars is Polynomial. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:85-99 [Conf]
   
9. Philippe Devienne, Patrick Lebègue
   Weighted Graphs: A Tool for Logic Programming. [Citation Graph (0, 0)][DBLP]
   CAAP, 1986, pp:100-111 [Conf]
   
10. Gilberto Filé
    Classical and Incremental Evaluators for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:112-126 [Conf]
    
11. Alberto Pettorossi
    Transformation Strategies for Deriving On Line Programs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:127-141 [Conf]
    
12. David de Frutos-Escrig
    Probabilistic Ianov's Schemes. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:142-157 [Conf]
    
13. Kai Salomaa
    Alternating Bottom-Up Tree Recognisers. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:158-171 [Conf]
    
14. Rafael Casas, Jean-Marc Steyaert
    Bottom-Up Recursion in Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:172-182 [Conf]
    
15. Heiko Vogler
    Basic Tree Transducers. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:183-195 [Conf]
    
16. Philippe Jacquet, Mireille Régnier
    Trie Partitioning Process: Limiting Distributions. [Citation Graph (1, 0)][DBLP]
    CAAP, 1986, pp:196-210 [Conf]
    
17. Guy Louchard
    Random Walks, Gaussian Processes, and List Structures. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:211-224 [Conf]
    
18. René Schott
    Random Walks on Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:225-237 [Conf]
    
19. Ran Rinat, Nissim Francez, Orna Grumberg
    Infinite Trees, Markings and Well Foundedness. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:238-253 [Conf]
    
20. Elias Dahlhaus, Johann A. Makowsky
    Computable Directory Queries. [Citation Graph (3, 0)][DBLP]
    CAAP, 1986, pp:254-265 [Conf]
    
21. Andrea Asperti, Giuseppe Longo
    Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:266-287 [Conf]
    
22. Grazyna Mirkowska, Andrzej Salwicki
    On Applications of Algorithmic Logic. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:288-306 [Conf]