Published: 28th August 2013|
|Non-monotonic Pre-fixed Points and Learning Stefano Berardi and Ugo de' Liguoro||1|
|From Branching to Linear Time, Coalgebraically Corina Cirstea||11|
|A Coinductive Approach to Proof Search José Espírito Santo, Ralph Matthes and Luís Pinto||28|
|Infinitary Axiomatization of the Equational Theory of Context-Free Languages Niels Bjørn Bugge Grathwohl, Fritz Henglein and Dexter Kozen||44|
|The Fixed-Point Theory of Strictly Contracting Functions on Generalized Ultrametric Semilattices Eleftherios Matsikoudis and Edward A. Lee||56|
|Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion Stefan Milius and Tadeusz Litak||72|
|Łukasiewicz mu-Calculus Matteo Mio and Alex Simpson||87|
This volume contains the proceedings of the Ninth Workshop on Fixed Points in Computer Science (FICS 2013) which took place on September 1st 2013 in Torino, Italy as a satellite event of the conference Computer Science Logic (CSL 2013).
Fixed points play a fundamental role in several areas of computer science. They are used to justify (co)recursive definitions and associated reasoning techniques. The construction and properties of fixed points have been investigated in many different settings such as: design and implementation of programming languages, logics, verification, databases. The FICS workshop aims to provide a forum for researchers of the computer science and logic communities who study or apply the theory of fixed points.
The editors thank all authors who submitted papers to FICS 2013, and program committee members Andreas Abel, Lars Birkedal, Javier Esparza, Neil Ghani, Dexter Kozen, Ralph Matthes, Paul-André Melliès, Matteo Mio, Luke Ong, Pawel Parys, Luigi Santocanale, Makoto Tatsuta and Wolfgang Thomas for their work in selecting papers.
Apart from presentations of accepted papers, we are delighted that FICS 2013 featured three invited talks: Anuj Dawar on Fixed point approximations of graph isomorphisms, Nicola Gambino on Cartesian closed bicategories and Alexandra Silva on Rational fixed points in programming languages. Many thanks to them for having accepted the invitation.
Finally, we would like to express our deep gratitude to CSL 2013 for local organization and to EACSL, INRIA and Université Marne-la-Vallée for funding FICS 2013.
| David Baelde