Call for Participation 6th Workshop on Fixed Points in Computer Science, FICS 2009 Coimbra, Portugal, 12-13 September 2009, a satellite workshop of CSL 2009, colocated with PPDP 2009, LOPSTR 2009 http://cs.ioc.ee/fics09/ Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops where held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop). Topics for the call for papers included, but were not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers Robin Cockett (University of Calgary) Javier Esparza (Technische Universität München) Yde Venema (Universiteit van Amsterdam) Contributed talks Loredana Afanasiev and Balder ten Cate On core XPath with inflationary fixed points Lars Birkedal, Kristian Støvring and Jacob Thamsborg Solutions of generalized recursive metric-space equations Pierre Clairambault Least and greatest fixpoints in game semantics Zoltán Ésik and Stephen L. Bloom Scattered algebraic linear orderings Stephan Kreutzer and Martin Lange A note on the relation between inflationary fixpoints and least fixpoints of higher order Omer Landry Nguena Timo and Pierre-Alain Reynier On characteristic formulae for event-recording automata Robert Myers Regular expressions and the coalgebraic mu-calculus Milad Niqui and Jan Rutten Coinductive predicates as final coalgebras Pawel Parys Lower bound for evaluation of mu-nu fixpoint Dulma Rodriguez and Martin Hofmann Membership checking in greatest fixpoints revisited Daniel Stamate A bilattice based fixed point semantics for integrating imperfect information Kohtaro Tadaki Fixed points on partial randomness Yoshinori Tanabe and Masami Hagiya Fixed-point computations over functions on integers with operations min, max and plus Balder ten Cate and Gaelle Fontaine An easy completeness proof for the modal mu-calculus on finite trees Lionel Vaux A non-uniform finitary relational semantics of system T Programme committee Yves Bertot (INRIA Sophia Antipolis) Anuj Dawar (University of Cambridge) Peter Dybjer (Chalmers University of Technology) Zoltán Ésik (University of Szeged) Masahito Hasegawa (Kyoto University) Anna Ingólfsdóttir (Reykjavik University) Ralph Matthes (IRIT, Toulouse) (co-chair) Jan Rutten (CWI and Vrije Universiteit Amsterdam) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Tarmo Uustalu (Institute of Cybernetics, Tallinn) (co-chair) Igor Walukiewicz (LaBRI, Bordeaux) Registration and cost Registration is through the CSL/PPDP/LOPSTR website. The FICS participation fee of 80 EUR includes 4 coffee breaks and the workshop dinner on Saturday. All workshop participants will receive a copy of the informal workshop proceedings. The early registration deadline for the CSL/PPDP/LOPSTR main conferences is 31 July. For FICS, there is no early/late rate difference. Sponsors EXCS, Estonian Centre of Excellence in Computer Science [For admin and other information see: http://www.mta.ca/~cat-dist/ ]