Advanced Topics in Programming Languages and Concurrency (AToPLaC)
Summer Semester 2003
School of Computer and Communication Sciences
Programming Methods Laboratory (LAMP)
 
 
Home
Staff
Research
Publications
Events
Teaching
  AToPLaC
    News
    Overview
    Contents
    Slides
    Rules
    Contact
    Links
Jobs
   
 
  
     

Thursday 13:15-16:00, Room INM 202

News

03/06/03
  • fixed replacement date for the cancelled session
03/04/03
  • added link to Mobile Objects
13/03/03

Overview

The course covers in more detail selected topics from the winter semester course "Concurrency: Theory, Languages, and Programming". It provides a seminar-style introduction into recent fundamental research literature of the area.

Contents

Basic principles of modern type systems for programming languages, and their usage. Basic Calculi to model programming language paradigms in a concurrent languages setting, ranging from functional over object-oriented to distributed wide-area programming, as well as cryptographic extensions.

Schedule, with Slides

  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
  6. [2003-04-17] Gabriel Kälin & Martin Schaffner: Types in Java

    Easter Break

  7. [2003-05-01] Christophe Gensoul: Cryptographic Processes
  8. [2003-05-08] Gabriel Kälin & Martin Schaffner: Proof-Carrying Code
  9. [2003-05-15] Johannes Borgström: Wide-Area Programming
  10. [2003-05-22] cancelled ...moved to [2003-06-12]
  11. [2003-05-29] Ascension
  12. [2003-06-05] Burak Emir: Regular Types
  13. [2003-06-12] Vlad Tanasescu: Join Programming Abstraction [2003-06-12] Marc de la Gueronniere: Object Types
  14. [2003-06-19] Lam-Son Le: .NET CLR

Not Selected Presentation References:

  1. types in process calculi (should be after 1.)
  2. functions as processes (should be after 1.)
  3. objects as processes (should be after 1.)
  4. distributed process calculi (requires previous)
  5. [optional:] probabilistic extensions of process calculi
    • Herescu & Palamidessi.
    • Roberto Segala.

Accompanying Recommended Textbooks:

Rules

  • 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

Contact

Professors: Assistants:

Related Links


     
      
Last modified: Monday, 01-Mar-2004 14:23:48 CET