Programme of DICE at ETAPS 2010

(Developments in Implicit Computational Complexity)

Sunday, March 28

09:30 - 10:30 SESSION 5: Invited Talk

S. Martini. Implicit computational complexity in the small

10:30 - 11:00 Coffee Break

11:00 - 12:30 SESSION 6

Church => Scott= Ptime: an application of resource sensitive realizability
Alois Brunel, K. Terui
Safe Recursion on Notation into a light logic by levels.
L. Roversi, L. Vercelli

12:30 - 14:00 Lunch

14:00 - 15:00 SESSION 7

A calculus for game-based security proofs.
Y. Zhang, D. Nowak
Non-interference types and tier recursion
J.-Y. Marion
 
ETAPS 2010 | Top | Last Update: 2010-02-04