Location : Lectures: Darwin Building Lecture Theatre G10 (ground floor) Room for discussions: seminar room 712 Lunches will be held in the JCMB (next to Darwin Building) in 2511(10). =============================================== Tuesday 7. Sept 9.30 - 10.00 Registration D: Verification methods 10.05 - 10.35 D : Eugenio Moggi Monadic Encapsulation of Effects: a Revised Approach 10.40 - 11.10 D : Andy Gordon Anytime, anywhere: modal logics for mobile ambients 11.15 - 11.45 Tea/Coffee Break 11.50 - 12.20 D : Peter O' Hearn Petri Net Semantics of Bunched Implication 12.25 - 12.55 D : Don Sannella Pre-logical relations 13.00 - 14.30 LUNCH BREAK 14.30 - 15.00 Bent Thomsen Industrial talk H: Semantics-based optimisation 15.05 - 15.35 H : Lars Pareto Recursion and Dynamic Datastructures in Bounded Space: Towards embedded ML programming 15.40 - 16.15 Tea/Coffee Break A: Semantics for object-oriented programming 16.15 - 16.45 A : Paul Blain Levy Game Semantics for Call-By-Push-Value 16.50 - 17.20 A : Didier Remy Assembling Objects with Internal Concurrency Using Inheritance of Behavior and Refinement of Synchronization =============================================== Wednesday 8.Sept F: Games, sequentiality, and abstract machines 9.30 - 10.00 F : Andrew Ker Universal Game Models of Untyped Lambda Calculu 10.05 - 10.35 F : Paul Andre Mellies Hypercoherence spaces as concurrent games 10.40 - 11.10 F : Martin Wehr Algebraic Analysis of Full Completeness 11.15 - 11.45 Tea/Coffee Break 11.50 - 12.20 F : Marisa Lenisa Fully Complete Models for ML Polymorphic Types 12.25 - 12.55 F : Samson Abramsky Process Realisability 13.00 - 14.30 LUNCH BREAK G: Types and type inference in programming 14.30 - 15.00 G : Giorgio Ghelli Typing Ambients using Ambient Groups 15.05 - 15.35 G : Francois Pottier Three parts for a powerful type inference engine 15.40 - 16.15 Tea/Coffee Break 16.15 - 16.45 G : Alan Mycroft Compile-time pointer control for C/C++ 16.50 - 17.20 G : Luke Ong A Linear-time Algorithm for Verifying MLL Proof Nets via Lamarche's Essential Nets 17.30 - 19.00 Business-meeting 19.30 - Workshop-dinner =============================================== Thursday 9.Sept B: Program structuring 9.30 - 10.00 B : Barry Jay Functorial Lambda-Calculus 10.05 - 10.35 B : Hayo Thielecke On the (continuation) semantics of ML exceptions 10.40 - 11.10 B : Paul Taylor Imperative interpretation of mathematics? 11.15 - 11.45 Tea/Coffee Break C: Integration of functional languages and proof assistants 11.50 - 12.20 C : Andrew Pitts Symbolic Computation Modulo Alpha Conversion E: Automatic program transformation 12.25 - 12.55 E : Jens Peter Secher On Perfect Supercompilation 13.00 - 14.30 LUNCH BREAK I: Domain theory and real number computation 14.30 - 15.00 I : Abbas Edalat Foundation of a Computable Topology for Solid Modelling 15.05 - 15.35 I : Reinhold Heckmann Complexity of Real Arithmetic by Linear Fractional Transformations 15.40 - 16.15 Tea/Coffee Break 16.15 - 16.45 I : Hideki Tsuiki Gray Code Representation of Exact Real Numbers 16.50 - 17.20 I : Alex Simpson What a model of PCF is! 17.20 - 17.50 I : Achim Jung A relational category of topological spaces 18.00 - APPSEM-Goobye and CTCS-Reception