Programme Committee
Steering Committee

Tentative Programme

9.00-10.00Invited Talk
Ugo Dal Lago: Implicit Complexity in a Concurrency Scenario
10.00-10.30Coffee Break
10.30-12.30Contributed Talks
Guillaume Bonfante.
Course of value in programming languages
Stephen Cook and Lila Fontes.
Formal Theories for Linear Algebra
Marco Gaboardi and Brian Redmond.
Towards a Light Logic for PSPACE
Pierre Boudes, Damiano Mazza and Lorenzo Tortora de Falco.
A Categorical Construction for Linear Logic by Levels
12.30-14.00Lunch Break
14.00-15.00Invited Talk
Stephen Cook
Bounded Reverse Mathematics
15.00-15.30Coffee Break
15.30-16.30Invited Talk
Albert Atserias
On Spectral Methods as Refutation Heuristics
16.30-17.00Coffee Break
17.00-18.00Contributed Talks
Alexander Rabinovich.
Temporal logics over linear time domains are in PSPACE
Jiamou Liu.
Recursion-Theoretic Complexity of \omega-Automatic Trees