Home

Conference program

Call For papers

Call for Workshops and Co-located Events

Conference Organizers

SIGPLAN Awards

TutorialFest!

The POPL 2012 TutorialFest contains no less than seven tutorials, covering a variety of topics. The tutorials will be held on January 28, immediately following the main POPL conference. A separate TutorialFest registration is required.

Registrants of TutorialFest may attend any of the tutorials offered throughout the day. (This allows following four tutorials in full.) To keep costs down, no meals are included.

Most tutorials will be held twice during the day, giving attendees plenty of options for scheduling. This year, POPL is favouring a "distilled tutorial format": each tutorial will be 90 minutes, rather than a half day.

Early tutorial registration fee is $60 for students, $90 for SIGPLAN and/or ACM members and $120 for all others.

Late tutorial registration fee is $80 for students, $120 for SIGPLAN and/or ACM members and $150 for all others.

Note that registration gives access to all tutorials, you don't need to register separately for each tutorial.

  • Juliusz Chroboczek, Universite de Paris-Diderot (Paris 7), Paris, France
    • Serialising a concurrent program using continuation-passing style
      [Show details]
  • Byron Cook, Microsoft Research, Cambridge and Queen Mary, University of London
    • Proving program termination and liveness
      [Show details]
  • William Cook, University of Texas, Austin
    • Build your own partial evaluator in 90 minutes
      [Show details]
  • Martin Escardo, University of Birmingham
    • Seemingly impossible functional programs
      [Show details]
  • Andreas Gal, Mozilla
    • Compiling the Web
      [Show details]
  • Rustan Leino, Microsoft Research
    • Using Chalice to reason about objects and concurrency
      [Show details]
  • Peter O'Hearn, Queen Mary, University of London
    • Separation Logic
      [Show details]