ICFP PC Functional Programming Workshop
April 30, 2009
Provisional Schedule:
(Note: Timings/titles subject to change)
9:30-10:00
Gathering.
10:00-10:10
Welcome and Introduction.
10:10-10:40
Algebra of Programming using Dependent Types. Shin-Cheng Mu (Academia Sinica)
10:50-11:20
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. Lars Birkedal (IT University of Copenhagen) (slides in pdf)
11:30-12:00
A Compiler on a Page. Kristoffer Rose (IBM Thomas J. Watson Research Center)
Venue:
The Vanport Room (rm 338)
Smith Memorial Student Union
Portland State University
Portland, Oregon, USA.
(At Harrison and Broadway;
enter via door on Harrison and take stairs to 3rd floor)
1:00-1:30
A Proof Theory for Compilation. Atsushi Ohori (Tohoku University)
1:40-2:10
Data Parallelism in Haskell. Manuel Chakravarty (University of New South Wales) (slides in pdf)
2:20-2:50
Push-down control-flow analysis of higher-order programs. Matthew Might (University of Utah)
3:20-3:50
Slicing It: indexed containers in Haskell. Conor McBride (University of Strathclyde)
4:00-4:30
Title to be announced. Daan Leijen (Microsoft Research)
4:40-5:10
Obsidian: A Domain Specific Embedded Language for General-Purpose Parallel Programming of Graphics Processors. Koen Claessen (Chalmers University of Technology)
5:20
Adjourn.
Lunch* (one hour)
Break (thirty minutes)
