The 11th ACM SIGPLAN International Conference on Functional Programming
(ICFP 2006)

Portland, Oregon,
September 18-20, 2006

Preliminary Program

9:00-10:00: Invited talk: R. Kent Dybvig (Indiana University)
10:30-12:00: Improving Flow Analyses via Gamma-CFA: Abstract Garbage Collection and Counting
Matthew Might (Georgia Institute of Technology), Olin Shivers (Northeastern University); Delimited Dynamic Binding
Oleg Kiselyov (FNMOC), Chung-chieh Shan (Rutgers University), Amr Sabry (Indiana University); Static Typing for a Faulty Lambda Calculus
David Walker, Lester Mackey, Jay Ligatti, George A. Reis, David I. August (Princeton University)
13:30-15:00: Simple Unification-based Type Inference for GADTs
Simon Peyton Jones (Microsoft Research), Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn (University of Pennsylvania); Polymorphism and Separation in Hoare Type Theory
Aleksandar Nanevski, Greg Morrisett (Harvard University), Lars Birkedal (IT University of Copenhagen); Recursive Modules for Programming
Keiko Nakata (University of Kyoto) and Jacques Garrigue (Nagoya University)
15:30-17:00: From Structures and Functors to Modules and Units
Scott Owens, Matthew Flatt (University of Utah); The Missing Link - Dynamic Components for ML
Andreas Rossberg (Universitat des Saarlandes); Static Analysis for Syntax Objects
David Fisher (Georgia Institute of Technology), Olin Shivers (Northeastern University)
17:00-17:30: Business meeting and PC chair's report

9:00-10:00: Invited talk: Marc Shapiro (INRIA Rocquencourt)
10:30-12:00: Transactional Events
Kevin Donnelly (Boston University), Matthew Fluet (Cornell University); Stabilizers: A Modular Checkpointing Abstraction for Concurrent Functional Programs
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan (Purdue University); Modelling Deterministic Concurrent I/O
Malcolm Dowse, Andrew Butterfield (Trinity College Dublin)
13:30-15:00: Modular Development of Certified Program Verifiers with a Proof Assistant
Adam Chlipala (University of California, Berkeley); Mechanized Meta-Reasoning Using a Hybrid HOAS/de Bruijn Representation and Reflection
Jason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov (California Institute of Technology); Equality of Streams is a Pi_2^0-Complete Problem
Grigore Rosu (University of Illinois at Urbana-Champaign)
15:30-16:30: OCaml + XDuce
Alain Frisch (INRIA Rocquencourt); bixid: A bidirectional transformation language for XML
Shinya Kawanaka (IBM Tokyo Research Laboratory), Haruo Hosoya (The University of Tokyo)
16:45-18:00: Programming contest report

9:00-10:00: Invited talk: Richard Bird (Oxford University)
10:30-12:00: A Pattern for Almost Compositional Functions
Bjorn Bringert, Aarne Ranta (Chalmers University of Technology and Goteborg University); Algebraic Fusion of Functions with an Accumulating Parameter and Its Improvement
Shin-ya Katsumata, Susumu Nishimura (Kyoto University); Extensible Programming with First-Class Cases
Matthias Blume, Umut A. Acar, Wonseok Chae (Toyota Technological Institute at Chicago)
13:30-15:30: Boxy Types: Inference for Higher-Rank Types and Impredicativity
Dimitrios Vytiniotis, Stephanie Weirich (University of Pennsylvania), Simon Peyton Jones (Microsoft Research); Access Control in a Core Calculus of Dependency
Martin Abadi (University of California, Santa Cruz and Microsoft Research, Silicon Valley); Programming Monads Operationally with Unimo
Chuan-kai Lin (Portland State University); Abstraction Preservation and Subtyping in Distributed Languages
Pierre-Malo Denielou, James J. Leifer (INRIA Rocquencourt)