[TYPES/announce] FICS 2013 - call for participation

[David Baelde]

                     Call for Participation

                           FICS 2013
              September 1st, 2013, Torino, Italy
                Satellite workshop to CSL 2013

                 http://fics2013.univ-mlv.fr/

VENUE

The workshop will be held Sunday, September 1st at the Rettorato of the
University of Torino.

PROGRAMME

The programme is now available:
  http://fics2013.univ-mlv.fr/programme.html

BACKGROUND

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 aim of this 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.

Topics include, but are 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
  * fixed points in the mu-calculus and modal logics
  * fixed points in process algebras and process calculi
  * fixed points in functional programming and type theory
  * fixed points in relation to dataflow and circuits
  * fixed points in logic programming and theorem proving
  * fixed points in finite model theory, descriptive complexity theory,
    and databases

INVITED TALKS

* Anuj Dawar:  Fixed-point approximations of graph isomorphism

* Nicola Gambino: Cartesian closed bicategories

* Alexandra Silva: Rational fixpoints in programming languages

CONTRIBUTED TALKS

* Stefano Berardi and Ugo de' Liguoro
  Non-monotonic Pre-fixed Points and Learning

* Corina Cirstea
  From Branching to Linear Time, Coalgebraically

* José Espírito Santo, Ralph Matthes and Luís Pinto
  A Coinductive Approach to Proof Search

* Niels Bjørn Bugge Grathwohl, Fritz Henglein and Dexter Kozen
  Infinitary Axiomatization of
    the Equational Theory of Context-Free Languages

* Eleftherios Matsikoudis and Edward A. Lee
  The Fixed-Point Theory of Strictly Contracting Functions
    on Generalized Ultrametric Semilattices

* Stefan Milius and Tadeusz Litak
  Guard Your Daggers and Traces:
    On The Equational Properties of Guarded (Co-)recursion

* Matteo Mio and Alex Simpson
  Lukasiewicz mu-Calculus

PROGRAM COMMITTEE

  Andreas Abel (Ludwig-Maximilians-Universität München)
  David Baelde, co-chair (ENS Cachan)
  Lars Birkedal (Aarhus University)
  Arnaud Carayol, co-chair (CNRS / Université Paris-Est, Marne-la-Vallée)
  Javier Esparza (Technische Universität München)
  Neil Ghani (University of Strathclyde)
  Dexter Kozen (Cornell University)
  Ralph Matthes (IRIT, Toulouse)
  Paul-André Melliès (CNRS / Université Paris Denis Diderot)
  Matteo Mio (CWI, Amsterdam)
  Pawel Parys (Warsaw University)
  Luke Ong (University of Oxford)
  Luigi Santocanale (LIF, Université Aix-Marseille I)
  Makoto Tatsuta (National Institute of Informatics, Tokyo)
  Wolfgang Thomas (RWTH Aachen University, Germany)

SPONSORS

  European Association for Computer Science Logic
  INRIA
  Université Paris-Est Marne-la-Vallée