PRELIMINARY PROGRAMME OF ICC'01


Sunday 20.5. 

13:00-14:00 Registration

14:00 Welcome

Session 1: Function algebras and type systems
---------------------------------------------

14:10-14:40
Aehlig-Johannsen-Schwichtenberg-Terwijn: 
 Linear ramified higher-type recursion and parallel computation

14:40-15:10
Spreen:
 Safe weak minimization revisited

15:10-15:40
Caporaso: 
 Feasibility, Provability, and restrictions to von Neumann Architecture

15:40-16:20 Coffee break


Session 2: Higher type complexity
---------------------------------

16:20-16:50
Kohlenbach:
 Proof mining in functional analysis:

16:50-17:20
Royer:
 On type 2 complexity classes 

17:20-17:30 Break

17:30-18:00
Oliva-Kohlenbach:
 Proof mining in L1-approximation

18:00-18:30
Hofmann: The strength of non size-increasing computation

Monday 21.5.01

Session 3: Program analysis and ICC
-----------------------------------
9:00-9:30
Leivant:
 Termination proofs and complexity certification

9:30-10:00
Moyen: 
 An analyser of rewriting systems complexity


10:00-10:20 Coffee break

10:20-10:50
Niggl-Kristiansen:
 On the computational complexity of stack programs

10:50-11:20 
Leivant:
 TBA

11:20-11:30 Break

11:30-12:30
Jones (Invited Talk):
 Program analysis for Implicit Computational Complexity

12:30-2:00 Lunch