Title pages, preface and table of contents |
1 |

Pola: a language for PTIME programming
Michael J. Burrell, Robin Cockett and Brian F. Redmond |
7 |

Solving fixed-point equations on ω-continuous semirings
Javier Esparza, Stefan Kiefer and Michael Luttenberger |
9 |

Fixpoint logics and automata: a coalgebraic approach
Yde Venema |
10 |

On core XPath with inflationary fixed points
Loredana Afanasiev and Balder ten Cate |
11 |

Solutions of generalized recursive metric-space equations
Larst Birkedal, Kristian Støvring and Jacob Thamsborg |
18 |

Scattered algebraic linear orderings
Stephen L. Bloom and Zoltán Ésik |
25 |

An easy completeness proof for the modal μ-calculus on finite trees
Balder ten Cate and Gaëlle Fontaine |
30 |

Least and greatest fixpoints in game semantics
Pierre Clairambault |
39 |

Membership checking in greatest fixpoints revisited
Martin Hofmann and Dulma Rodriguez |
46 |

A note on the relation between inflationary fixpoints and least fixpoints of higher order
Stefan Kreutzer and Martin Lange |
54 |

Coalgebraic expressions
Robert S. R. Myers |
61 |

On characteristic formulae for event-recording automata
Omer Landry Nguena Timo and Pierre-Alain Reynier |
70 |

Coinductive predicates as final coalgebras
Milad Niqui and Jan Rutten |
79 |

Lower bound for evaluation of μ-ν fixpoint
Paweł Parys |
86 |

A bilattice based fixed point semantics for integrating imperfect information
Daniel Stamate |
93 |

Fixed points on partial randomness
Kohtaro Tadaki |
100 |

Fixed-point computations over functions on integers with operations min, max and plus
Yoshinori Tanabe and Masami Hagiya |
108 |

A non-uniform finitary relational semantics of System T
Lionel Vaux |
116 |

Author index |
124 |