03/06/03

• fixed replacement date for the cancelled session

03/04/03

• added link to Mobile Objects

13/03/03

• current subscriptions
• website set up

1. [2003-03-13] Introduction & Information (probably rather short)
2. [2003-03-20] Prof. Odersky: The Simply Typed Lambda Calculus (.pdf, .ps )

3. [2003-03-27] Prof. Odersky: Polymorphism (.pdf, .ps )
4. [2003-04-03] Prof. Nestmann: Mobile Objects
5. [2003-04-10] Lukas Keller: Types
   • On Understanding Types, Data Abstraction, and Polymorphism.
     Luca Cardelli & Peter Wegner.
6. [2003-04-17] Gabriel Kälin & Martin Schaffner: Types in Java
   • Featherweight Java.
     Atsushi Igarashi & Benjamin C. Pierce & Philip Wadler.

   Easter Break

7. [2003-05-01] Christophe Gensoul: Cryptographic Processes
   • A Calculus for Cryptographic Protocols: the Spi Calculus .
     Martín Abadi & Andrew D. Gordon.
8. [2003-05-08] Gabriel Kälin & Martin Schaffner: Proof-Carrying Code
   • Proof-Carrying Code.
     George C. Necula.
9. [2003-05-15] Johannes Borgström: Wide-Area Programming
   • Mobile Ambients.
     Luca Cardelli & Andrew D. Gordon.
   • [motivation:] Wide Area Computation.
     Luca Cardelli.
10. [2003-05-22] cancelled ...moved to [2003-06-12]
11. [2003-05-29] Ascension
12. [2003-06-05] Burak Emir: Regular Types
    • Regular Expression Types.
      Haruo Hosoya & Jerome Vouillon & Benjamin C. Pierce.
    • Regular Object Types.
      Vladimir Gapeyev and Benjamin C. Pierce.
13. [2003-06-12] Vlad Tanasescu: Join Programming Abstraction
    • The Reflexive Chemical Abstract Machine and the Join Calculus.
      Cédric Fournet & Georges Gonthier.
    • [practically:] Join Calculus.
      
    • polyphonic C#.
      Luca Cardelli & Cédric Fournet.
    [2003-06-12] Marc de la Gueronniere: Object Types
    • A Theory of Primitive Objects: Untyped and First-Order Systems
      Martín Abadi & Luca Cardelli.
14. [2003-06-19] Lam-Son Le: .NET CLR
    • Unboxed Objects and Polymorphic Typing.
      Xavier Leroy.
    • Design and Implementation of Generics for the .NET CLR.
      Andrew Kennedy & Don Syme.

Not Selected Presentation References:

1. types in process calculi (should be after 1.)
   • Typing and Subtyping for Mobile Processes.
     Benjamin C. Pierce & Davide Sangiorgi.
   • [practically:] A Programming Language Based on the Pi-Calculus.
     Benjamin C. Pierce & David N. Turner.
   • [optional:] Behavioral Equivalence in the Polymorphic Pi-Calculus.
     Benjamin C. Pierce & Davide Sangiorgi.
2. functions as processes (should be after 1.)
   • Interpreting functions as pi-calculus processes: a tutorial.
     Davide Sangiorgi.
   • Functions as Processes.
     Robin Milner.
3. objects as processes (should be after 1.)
   • Concurrent Objects in a Process Calculus.
     Benjamin C. Pierce & David N. Turner.
   • Imperative Objects as Mobile Processes
     Josva Kleist & Davide Sangiorgi
   • [optional:] A Pi Calculus Semantics of Java.
     Bart Jacobs & Frank Piessens.
4. distributed process calculi (requires previous)
   • Distributed Join Calculus.
     Didier Remy & Cédric Fournet & Georges Gonthier & Cosimo Laneve.
   • Location-Independent Communication for Mobile Agents: a Two-Level Architecture.
     Benjamin C. Pierce & Peter Sewell & Pawel Wojciechowski.
   • [support:] Located Process Calculi: An Introduction (slides of a talk).
     Matthew Hennessy.
5. [optional:] probabilistic extensions of process calculi
   • Herescu & Palamidessi.
   • Roberto Segala.

Accompanying Recommended Textbooks:

• Types and Programming Languages.
  Benjamin C. Pierce.
• Communication and Concurrency.
  Robin Milner.
• Communicating and Mobile Systems: the Pi-Calculus.
  Robin Milner.
• The Pi-Calculus - A Theory of Mobile Processes.
  Davide Sangiorgi & David Walker.
• Modelling and Analysis of Security Protocols.
  Peter Ryan & Steve Schneider.

• FCFS !
• the structure of a typical presentation session is:
  • around 45 minutes of presentation, but can be more
  • around 45 minutes of focused discussion, where the presenter will prove to actually have deeply understood the contents of the chosen papers
  • around 45 minutes of open discussion that may be taken to draw connections with other topics, or as preparation for the later topics of the course
• every presenter will provide handouts to every participant before the presentation (in some compact format, but with enough room for notes)
• there is going to be an oral exam after the semester, where the contents are
  • the topic chosen by the respective candidate
  • three other topics, up to the choice of the candidate among the ones treated during the course
• the second exam requirement implies that presentations must indeed be understandable for everyone in the course such that they can decide on this basis which topics to choose and prepare for the exam
• marks will be given in 65%-35% on the presentation versus the exam; however, an exam without presentation is considered useless and does not count anything.
• presentations may be prepared and given in groups, but then of course on multiple occasions such that each presenter on the whole talks for 45 minutes and replies for another 45 minutes

• Uwe Nestmann, Programming Methods Laboratory
      Uwe.Nestmann@epfl.ch, INR 317, Tel. +41 21 693 6865
• Martin Odersky, Programming Methods Laboratory
      Martin.Odersky@epfl.ch, INR 319, Tel. +41 21 693 6863

• Rachele Fuzzati, Programming Methods Laboratory
      Rachele.Fuzzati@epfl.ch, INR 316, Tel. +41 21 693 7691
• Daniel Bünzli, Programming Methods Laboratory
      Daniel.Buenzli@epfl.ch, INR 316, Tel. +41 21 693 7691
• Vincent Cremet, Programming Methods Laboratory
      Vincent.Cremet@epfl.ch, INR 320, Tel. +41 21 693 6867

• Scala tutorial
• Pict
• Nomadic Pict
• Calculi for Mobile Processes
• Concurrency Workbench (CWB)
• Mobility Workbench (MWB)