17. CAAP 1992: Rennes, France
Jean-Claude Raoult (Ed.):
CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings.
Lecture Notes in Computer Science 581 Springer 1992, ISBN 3-540-55251-0 
- Franco Barbanera, Stefano Berardi:
A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction.
1-23
- François Bergeron, Philippe Flajolet, Bruno Salvy:
Varieties of Increasing Trees.
24-48
- Yves Bertot:
Origin Functions in Lambda-Calculus and Term Rewriting Systems.
49-65
- Felice Cardone:
An Algebraic Approach to the Interpretation of Recursive Types.
66-85
- Anne-Cécile Caron:
Decidability of Reachability and Disjoint Union of Term Rewriting Systems.
86-101
- Mario Coppo, Paola Giannini:
A Complete Type Inference Algorithm for Simple Intersection Types.
102-123
- Bruno Courcelle:
Monadic Second-Order Graph Transductions.
124-144
- Mads Dam:
CTL* and ECTL* as Fragments of the Modal µ-Calculus.
145-164
- Reinhold Heckmann:
Power Domains Supporting Recursion and Failure.
165-181
- Wen-Jing Hsu, Carl V. Page, J. Liu:
Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection Topologies.
182-202
- Ugo de'Liguoro, Adolfo Piperno:
Must Preorder in Non-Deterministic Untyped Lambda-Calculus.
203-220
- Andrea Maggiolo-Schettini, Józef Winkowski:
A Programming Language for Deriving Hypergraphs.
221-231
- Ugo Montanari, Francesca Rossi:
Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics.
232-247
- Wuxu Peng, S. Purushothaman:
Empty Stack Pushdown Omega-Tree Automata.
248-264
- Andreas Potthoff:
Modulo Counting Quantifiers Over Finite Trees.
265-278
- Helmut Seidl:
Finite Tree Automata with Cost Functions.
279-299
- Steffen van Bakel, Sjaak Smetsers, Simon Brock:
Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems.
300-321
- Bart Vergauwen, Johan Lewi:
A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems.
322-341
- Uwe Wolter, Michael Löwe:
Beyond Conditional Equations: Quasi-Initial Semantics for Parametric Algebraic Specifications.
342-361
Last update Mon May 20 22:31:55 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
