March 31st
- 9.25: Welcome
- 9.30-10.30: Invited Talk 1
- Ulrich Schoepp. Computation by Interaction for Structuring Resource Bounded Computation
- 10.30-11.00: Coffee
- 11.00-12.30: Session 1 (Linear Logic)
- Alois Brunel and Antoine Madet. Quantitative Classical Realizability for Side Effects and Recursive Types.
- James Laird and Pierre Clairambault. A Bounded Linear Type Theory for Encapsulated State.
- Andrei Dorman and Damiano Mazza. A Polytime Lambda-Calculus Based on Linear Logic by Levels
- 12.30-14.00: Lunch
- 14.00-15.30: Session 2 (Lambda Calculus)
- Simona Ronchi Della Rocca and Erika De Benedetti. A complete polynomial lambda calculus.
- Stefano Guerrini, Thomas Leventis and Marco Solieri. Deep into Optimality - Complexity and correctness of sharing implementation of bounded logics.
- Beniamino Accattoli and Ugo Dal Lago. On the invariance of derivational complexity for head reduction.
- 15.30-16.00: Coffee
- 16.00-17.00: Session 3 (Term Rewriting)
- Martin Avanzini, Naohi Eguchi and Georg Moser. A New Path Order that Induces Tight Polynomial Derivation Lengths.
- Patrick Baillot and Ugo Dal Lago. Higher-Order Interpretations and Program Complexity.
- 17.00-18.00 business meeting
April 1st
- 11.00-12.00: Invited Talk 2
- Neelakantan R. Krishnaswami. Implicit Complexity for Functional Reactive Programs
- 12.00-12.30: Session 4 (Applicative Theories)
- Reinhard Kahle and Isabel Oitavem. Recursion and Induction for Computational Complexity
- 12.30-14.00: Lunch
- 14.00-15.30: Session 5 (dlPCF and Context Semantics)
- Alois Brunel and Marco Gaboardi. Realizability Models for dlPCF.
- Barbara Petit. Toward a Bounded Linear Type system for PCF in Call-by-value.
- Matthieu Perrinel. On the expressivity of linear logic subsystems characterizing polynomial time.
- 15.30-16.00: Coffee