Fifth Workshop on
12-13 April, 2003, Warsaw, Poland
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 (MFCS 98 workshop), Paris
(LC2000 workshop), Florence (PLI 01 workshop), Copenhagen (LICS 02
Topics include, but are not restricted to: Construction and reasoning about properties of fixed points, categorical, metric and ordered fixed point models, continuous algebras, relation algebras, regular algebras of finitary and infinitary languages, formal power series, word and tree automata, the mu-calculus and other programming logics, fixed points in process algebras and process calculi, fixed points and the lambda calculus, fixed points in relation to dataflow and circuits, fixed points in logic programming, databases and complexity theory.
Invited Speakers: Martin Grohe (Edinburgh), Erich Grädel (Aachen), Damian Niwinski (Warsaw), Leszek Pacholski (Wroclaw).
Submissions: Authors are invited to send three copies of an abstract not exceeding three pages to Igor Walukiewicz. Electronic submissions in the form of uuencoded postscript files are encouraged and can be sent to firstname.lastname@example.org. Submissions are to be received before February 14, 2003. Authors will be notified of acceptance by March 10, 2003. Final versions of the abstracts are to be received by March 17, 2003
Proceedings: Preliminary proceedings containing the abstracts of the talks will be available at the meeting. Final proceedings will be published after the meeting as a special issue of Theoretical Informatics and Application (RAIRO)