| Contents |
Semantics of interaction (invited talk) / S. Abramsky -- The Kronecker product and local computations in graphs / A. Bottreau and Y. Métivier -- Iterative pairs and multitape automata / M. Madonia and S. Varricchio -- Diophantine equations, Presburger arithmetic and finite automata / A. Boudet and H. Comon -- A pumping lemma for output languages of macro tree transducers / A. Kühnemann -- The area determined by underdiagonal lattice paths / D. Merlini, R. Sprugnoli and M.C. Verri -- Extraction of concurrent processes from higher dimensional automata / Y. Takayama -- Axiomatising extended computation tree logic / R. Kaivola -- Final semantics for a higher order concurrent language / M. Lenisa -- The practice of logical framework (invited talk) / F. Pfenning -- Subsumption algorithms based on search trees / L. Bachmair ... [et al.] -- Interaction nets and term rewriting systems (extended abstract) / M. Fernández and I. Mackie -- Computing in unpredictable environments : semantics, reduction strategies, and program transformations / B. Lisper -- Relative normalization in deterministic residual structures / J. Glauert and Z. Khasidashvili -- Termination by absence of infinite chains of dependency pairs / T. Arts -- Confluence without termination via parallel critical pairs / B. Gramlich -- An ordinal calculus for proving termination in term rewriting / E.A. Cichon and H. Touzet -- Behavioural satisfaction and equivalence in concrete model categories / M. Bidoit and A. Tarlecki -- Open maps, behavioural equivalences, and congruences / A. Cheng and M. Nielsen -- Denotational, causal, and operational determinism in event structures / A. Rensink -- Effective longest and infinite reduction paths in untyped [lambda]-calculi / M.H. Sørensen -- Full abstraction for Lambda calculus with resources and convergence testing / G. Boudol and C. Lavatelli -- Untyped Lambda-calculus with input-output / J. Tiuryn and M. Wand. |
