Regular papers

Jirí Adámek, Stefan Milius, and Jirí Velebil; Techn. U of Braunschweig, Germany
Parametric corecursion and completely iterative monads

Nick Benton, Microsoft Research Cambridge, UK and Martin Hyland, U Cambridge, UK
Traced pre-monoidal categories

Gerard Boudol and Pascal Zimmer, INRIA Sophia-Antipolis, France
Recursion in the call-by-value λ-calculus

Benet Devereux, U Toronto, Canada
Strong next-time operators for multiple-valued mu-calculus

Neil Ghani, U Leicester, UK; Christoph Lüth, U Bremen, Germany; and Federico De Marchi, U Leicester, UK
Coalgebraic approaches to algebraic terms

Thomas Jensen, Florimond Ployette, and Olivier Ridoux; IRISA Rennes, France
Iteration schemes for fixed point calculation

Margarita V. Korovina, U Aarhus, Denmark
Fixed points on abstract structures without the equality test

Hans Leiss, U Munich, Germany
Kleenean semimodules and linear languages

Luigi Santocanale, LaBRI Bordeaux, France
Congruences of modal µ-algebras

Nikolay Vyacheslavovich Shilov and Natalia Olegovna Garanina, IIS/RAS Novosibirsk, Russia
Model checking knowledge and fixpoints

Christoph Sprenger, Swedish Inst. of Computer Science, Sweden and Mads Dam, Royal Inst. of Techn., Sweden
A note on global induction in a mu-calculus with explicit approximations

Tarmo Uustalu, Tallinn Techn. U, Estonia
Generalizing substitution

Guo-Qiang Zhang, Case Western Reserve U, USA
Decidable fragments of domain mu-calculus: an automata-theoretic perspective