FLoC '02 - LL program

LL program

All sessions take place in auditorium 4.

Thursday's program is also available side by side with other meetings.

11:00-12:40 Session 1

11:00	Stefano Guerrini, U Rome I (La Sapienza), Italy Invited lecture: From proof nets to sharing graphs: From logic to implementations
11:50	Olivier Laurent, U Paris VII, France Invited lecture: Polarities in linear logic

12:40-14:00 Lunch

16:00-17:30 Session 2

16:00	Dale Miller, Penn State U, USA Higher-order quantification and proof search: an extended abstract
16:30	Nicholas Biri and Didier Galmiche, LORIA Nancy, France A modal linear logic for distribution and mobility
17:00	James Harland, RMIT U, Australia Issues for proof-theoretic modelling of embedded infinitary computations

Friday's program is also available side by side with other meetings.

09:00-10:40 Session 3

09:00	Richard Blute, U Ottawa, Canada Invited lecture: Linear logic, relations and vector spaces
09:50	Kazushige Terui, IML Marseille, France Invited lecture: On the complexity of cut elimination in linear logic

10:40-11:00 Refreshments

11:00-12:30 Session 4

11:00	Dominic Hughes and Rob van Glabbeek, Stanford U, USA MALL proof nets
11:30	Paul-André Melliès, U Paris VII, France Innocence in 2-dimensional games
12:00	Sergey Slavnov, Cornell U, USA Geometrical semantics for linear logic (multiplicative fragment)

12:30-14:00 Lunch

14:00-15:30 Session 5

14:00	Paolo Coppola, U Udine, Italy and Simona Ronchi Della Rocca, U Turin, Italy Principal typing in elementary affine logic
14:30	Josh Berdine, Queen Mary, U London, UK; Peter O'Hearn, Queen Mary, U London, UK; and Hayo Thielecke, U Birmingham, UK Extracting the range of CPS from affine typing
15:00	Luca Roversi, U Turin, Italy A bridge between a proof-theoretical and a declarative system for polynomial functions

15:30-15:50 Refreshments

15:50-16:50 Session 6

15:50	Berndt Farwer, U Hamburg, Germany and Kundan Misra, U Warwick, UK Object net modification using linear logic Petri nets
16:20	Marco Bozzano, ITC-irst, Italy and Giorgio Delzanno, U Genova, Italy Protocol verification via a bottom-up evaluation strategy for linear logic programs