FICS 2002

Fixed Points In Computer Science
Copenhagen, Denmark, July 20-21, 2002
Affiliated with LICS 2002

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. 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 fixed point operation in the different fields and formalisms.


Construction and reasoning about properties of fixed points, categorical, metric and ordered fixed point models, continuous algebras, relation algebras, fixed points in process algebras and process calculi, regular algebras of finitary and infinitary languages, formal power series, tree automata and tree languages, infinite trees, the mu-calculus and other programming logics, fixed points in relation to dataflow and circuits, fixed points and the lambda calculus, fixed points in logic programming and data bases.

Previous workshops were held in Brno (1998, MFCS workshop), Paris (2000, LC2000 workshop), Florence (2001, PLI 01 workshop).

Workshop web page

Invited speakers

  • Luca Aceto, Aalborg U, Denmark
    Kleene through the process algebraic glass
  • Dexter Kozen, Cornell U, USA
    On two letters versus three
  • Anna Labella, U Rome I (La Sapienza), Italy
    Kleene's (unary) star in nondeterministic context
  • Glynn Winskel, U Cambridge, UK
    Calculus for categories