All sessions of the workshop will take place in room 2.4 (2nd floor) of the Department of Mathematics (Largo Dom Dinis, see map).

Saturday, 12 September 2009

8:45-9:00 Registration
9:00-10:00 Javier Esparza
Solving fixed-point equations on ω-continuous semirings (slides)
Chair: ZoltŠn …sik
10:00-10:30 Daniel Stamate
A bilattice based fixed point semantics for integrating imperfect information
11:00-11:30 Stephan Kreutzer and Martin Lange
A note on the relation between inflationary fixpoints and least fixpoints of higher order
Chair: Damian Niwinski
11:30-12:00 Loredana Afanasiev and Balder ten Cate
On core XPath with inflationary fixed points
12:00-12:30 Omer Landry Nguena Timo and Pierre-Alain Reynier
On characteristic formulae for event-recording automata
14:00-15:00 Yde Venema
Fixpoint logics and automata: a coalgebraic approach (slides)
Chair: Luigi Santocanale
15:00-15:30 Robert Myers
Coalgebraic expressions
16:00-16:30 Milad Niqui and Jan Rutten
Coinductive predicates as final coalgebras
Chair: Alex Simpson
16:30-17:00 Lars Birkedal, Kristian StÝvring and Jacob Thamsborg
Solutions of generalized recursive metric-space equations
17:00-17:30 Pierre Clairambault
Least and greatest fixpoints in game semantics
20:00-Workshop dinner, at Restaurante O Trovador (Largo da Sť Velha 15-17, see map)

Sunday, 13 September 2009

9:00-10:00 Robin Cockett
Pola: a language for PTIME programming (slides)
Chair: Peter Dybjer
10:00-10:30 Lionel Vaux
A non-uniform finitary relational semantics of system T
11:00-11:30 Stephen L. Bloom and ZoltŠn …sik
Scattered algebraic linear orderings
Chair: Tarmo Uustalu
11:30-12:00 Yoshinori Tanabe and Masami Hagiya
Fixed-point computations over functions on integers with operations min, max and plus
12:00-12:30 Martin Hofmann and Dulma Rodriguez
Membership checking in greatest fixpoints revisited
14:00-14:30 Kohtaro Tadaki
Fixed points on partial randomness
Chair: Yde Venema
14:30-15:00 Pawel Parys
Lower bound for evaluation of μ-ν fixpoint
15:00-15:30 Balder ten Cate and GaŽlle Fontaine
An easy completeness proof for the modal μ-calculus on finite trees

Tarmo Uustalu
Last update 13 September 2009