Abstract is missing.
- A Constructive Valuation Interpretation for Classical Logic and its Use in Witness ExtractionFranco Barbanera, Stefano Berardi. 1-23
- Varieties of Increasing TreesFrançois Bergeron, Philippe Flajolet, Bruno Salvy. 24-48
- Origin Functions in Lambda-Calculus and Term Rewriting SystemsYves Bertot. 49-65
- An Algebraic Approach to the Interpretation of Recursive TypesFelice Cardone. 66-85
- Decidability of Reachability and Disjoint Union of Term Rewriting SystemsAnne-Cécile Caron. 86-101
- A Complete Type Inference Algorithm for Simple Intersection TypesMario Coppo, Paola Giannini. 102-123
- Monadic Second-Order Graph TransductionsBruno Courcelle. 124-144
- CTL* and ECTL* as Fragments of the Modal µ-CalculusMads Dam. 145-164
- Power Domains Supporting Recursion and FailureReinhold Heckmann. 165-181
- Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection TopologiesWen-Jing Hsu, Carl V. Page, J. Liu. 182-202
- Must Preorder in Non-Deterministic Untyped Lambda-CalculusUgo de Liguoro, Adolfo Piperno. 203-220
- A Programming Language for Deriving HypergraphsAndrea Maggiolo-Schettini, Józef Winkowski. 221-231
- Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering SemanticsUgo Montanari, Francesca Rossi. 232-247
- Empty Stack Pushdown Omega-Tree AutomataWuxu Peng, S. Purushothaman. 248-264
- Modulo Counting Quantifiers Over Finite TreesAndreas Potthoff. 265-278
- Finite Tree Automata with Cost FunctionsHelmut Seidl. 279-299
- Partial Type Assignment in Left Linear Apllicative Term Rewriting SystemsSteffen van Bakel, Sjaak Smetsers, Simon Brock. 300-321
- A Linear Algorithm for Solving Fixed-Point Equations on Transition SystemsBart Vergauwen, Johan Lewi. 322-341
- Beyond Conditional Equations: Quasi-Initial Semantics for Parametric Algebraic SpecificationsUwe Wolter, Michael Löwe. 342-361