Program

Saturday, May 12, 2012 (Ryerson 251)

11:30-13:00

Lunch

 

13:00-13:10

Opening remarks

13:10-13:40

Jean-Jacques Lévy — INRIA — Sequentiality in Kahn-Macqueen Networks and the Lambda-Calculus
Slides [pdf]

13:40-14:10

John Reppy — University of Chicago — Concurrency and Parallelism in ML
Slides [pdf]

 

14:10-14:30

Break

 

14:30-15:00

Luca Cardelli — Microsoft Research Cambridge — On Speaking Languages
Slides [pdf]

15:00-15:30

Andrew Appel — Princeton University — Ideal and Other Models of Recursive Polymorphic Types

 

15:30-15:50

Break

 

15:50-16:20

Mike Gordon — Cambridge University — Cryptoki in ML: Birth Pangs of a Project

16:20-16:50

Robert Harper — Carnegie Mellon University — Modules Matter Most
Slides [pdf]

 

18:00

Dinner and reception at the Quad Club
Mads Tofte — IT University of Copenhagen

Sunday, May 13, 2012 (Ryerson 251)

09:00-10:00

Continental Breakfast

 

10:00-10:30

Derek Dreyer — Max Planck Institute for Software Systems — The Difficulty of Improving Upon the Standard ML Module System
Slides [pdf]

10:30-11:00

Zhong Shao — Yale University — VeriML: Revisiting the Foundations of Proof Assistants
Slides [ppt]

11:00-11:30

David MacQueen — University of Chicago — Higher-Order Modules Revisited

 

11:30-11:40

Closing Remarks