Conferences in DBLP

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

1. Franco Barbanera, Stefano Berardi
   A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:1-23 [Conf]
   
2. François Bergeron, Philippe Flajolet, Bruno Salvy
   Varieties of Increasing Trees. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:24-48 [Conf]
   
3. Yves Bertot
   Origin Functions in Lambda-Calculus and Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:49-65 [Conf]
   
4. Felice Cardone
   An Algebraic Approach to the Interpretation of Recursive Types. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:66-85 [Conf]
   
5. Anne-Cécile Caron
   Decidability of Reachability and Disjoint Union of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:86-101 [Conf]
   
6. Mario Coppo, Paola Giannini
   A Complete Type Inference Algorithm for Simple Intersection Types. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:102-123 [Conf]
   
7. Bruno Courcelle
   Monadic Second-Order Graph Transductions. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:124-144 [Conf]
   
8. Mads Dam
   CTL* and ECTL* as Fragments of the Modal µ-Calculus. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:145-164 [Conf]
   
9. Reinhold Heckmann
   Power Domains Supporting Recursion and Failure. [Citation Graph (0, 0)][DBLP]
   CAAP, 1992, pp:165-181 [Conf]
   
10. Wen-Jing Hsu, Carl V. Page, J. Liu
    Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection Topologies. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:182-202 [Conf]
    
11. Ugo de'Liguoro, Adolfo Piperno
    Must Preorder in Non-Deterministic Untyped Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:203-220 [Conf]
    
12. Andrea Maggiolo-Schettini, Józef Winkowski
    A Programming Language for Deriving Hypergraphs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:221-231 [Conf]
    
13. Ugo Montanari, Francesca Rossi
    Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:232-247 [Conf]
    
14. Wuxu Peng, S. Purushothaman
    Empty Stack Pushdown Omega-Tree Automata. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:248-264 [Conf]
    
15. Andreas Potthoff
    Modulo Counting Quantifiers Over Finite Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:265-278 [Conf]
    
16. Helmut Seidl
    Finite Tree Automata with Cost Functions. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:279-299 [Conf]
    
17. Steffen van Bakel, Sjaak Smetsers, Simon Brock
    Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:300-321 [Conf]
    
18. Bart Vergauwen, Johan Lewi
    A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:322-341 [Conf]
    
19. Uwe Wolter, Michael Löwe
    Beyond Conditional Equations: Quasi-Initial Semantics for Parametric Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:342-361 [Conf]