Programme of the | Paphos, March 27-28, 2010. |
Saturday, march 27.
9:30-10:30 | (invited talk) A.Ben-Amram. On decidable growth-rate properties of imperative programs. |
10:30-11:00 | coffee break |
11:00-12:30 | U. Dal Lago, S. Martini and M. Zorzi. General Ramified Recurrence is Sound for Polynomial Time. |
G. Bonfante. Non confluence in implicit complexity characterizations. | |
14:00-16:00 | M. Lasson. Controlling program extraction in Elementary Linear Logic. |
P. Boudes, D. Mazza, L. Tortora de Falco. A Categorical Construction for Linear Logic by Levels. | |
S. Ronchi Della Rocca. Linearity and non-determinism: the resource lambda calculus. | |
M. Gaboardi, M. Pagani. Can Resource Calculus Be Resource Conscious? | |
16:00-16:30 | coffee break |
16:30-17:30 | B. Redmond. PTIME + a distributive law = PSPACE. |
U. Dal Lago, U. Schöpp. Experiments on logspace-programming with IntML. |
Sunday, march 28.
9:30-10:30 | (invited talk) S. Martini. Implicit computational complexity in the small. |
10:30-11:00 | coffee break |
11:00-12:30 | Alois Brunel, K. Terui. Church ⇒ Scott= Ptime: an application of resource sensitive realizability. |
L. Roversi, L. Vercelli. Safe Recursion on Notation into a light logic by levels. | |
14:00-15:00 | Y. Zhang, D. Nowak. A calculus for game-based security proofs. |
J.-Y. Marion. Non-interference types and tier recursion. |
This document was translated from LATEX by HEVEA.