Workshop on Implicit Computational Complexity
as part of GEOCAL'06

Marseille - Luminy
February 13 - 17, 2006


Scientific organizers: Patrick Baillot (LIPN, Univ. Paris 13), Jean-Yves Marion (LORIA Nancy).




Monday

13/2

Room Salle de conférence CIRM
9:00 - 10:30   Martin Hofmann Programming Languages for LOGSPACE
10:30 - 11:00  Coffee break
11:00 - 11:30  Reinhard Kahle Towards an Implicit Characterization of NC^k
11:30 - 12:15  Frédéric Dabrowski Feasible Reactivity for Synchronous Cooperative threads
12:30 - 14:00 Lunch
Room: Salle de conférence CIRM
14:00 - 14:45  Vincent Atassi Type Inference in Elementary Linear Logic with Coercions and its Implementation
14:45 - 15:30  Paolo Tranquilli The Typing Problem for Second Order Light Logics
15:30 - 16:00 Coffee break
16:00 - 16:45  Paulin de Naurois A Measure of Space for Computing over the Reals
16:45 - 17:30  Emmanuel Hainry Recursive Analysis and Real Recursive Functions

Tuesday

14/2

Room: Salle de conférence CIRM
9:00 - 10:30  James Royer Adventures in Time and Space
10:30 - 11:00  Coffee break
11:00 - 11:45  Jean-Yves Moyen Resource Control Graphs
11:45 - 12:30  Karl-Heinz Niggl Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
12:30 - 14:00  Lunch

Wenesday

15/2

Linguistic and Logic and Dynamics and structures of biological networks workshops

Thursday

16/2

Room: Annexe CIRM-CNRS
9:00 -10:30  Jean-Yves Girard Finiteness and Hyperfiniteness and Light Exponentials
10:30 - 11:00  Coffee break
11:00 - 11:45  Ugo Dal Lago Context Semantics, Linear Logic and Implicit Complexity
11:45 - 12:15  Ulrich Schöpp Space Efficiency and the Geometry of Interaction
12:30 - 14:00 Lunch
Room: Annexe CIRM-CNRS
14:00 - 15:30  Kazushige Terui Intersection Types for Implicit Computational Complexity
15:30 - 16:00  Coffee break
16:00 - 16:45  Simona Ronchi della Rocca Soft Linear Lambda-Calculus and Intersection Types
16:45 - 17:30  Daniel de Carvalho Non Uniform Semantics for Lambda-Calculus, Intersection Types and Computation Time

Friday

17/2

Room: Annexe CIRM-CNRS
12:30 - 14:00  Lunch
14:00 - 14:45  Harry Mairson MLL Normalization and Transitive Closure: Circuits, Complexity and Euler Tours
14:45 - 15:30  Isabel Oitavem Pointers and Polynomial Space Functions
15:30 - 16:00  Coffee break
16:00 - 16:45  Lorenzo Tortora de Falco Obsessional Cliques: a Semantic Characterization of Bounded Time Complexity
16:45 - 17:15  Brian Redmond Categorical Models of SLL and Ptime Computation