ICFP 2006 Invited speakers

• Richard Bird (Oxford University)

• R. Kent Dybvig (Indiana University)

• Marc Shapiro (INRIA Rocquencourt)

ICFP 2006 Accepted papers

• Access Control in a Core Calculus of Dependency
  Martin Abadi (University of California, Santa Cruz and Microsoft Research, Silicon Valley)

• Extensible Programming with First-Class Cases
  Matthias Blume, Umut A. Acar, Wonseok Chae (Toyota Technological Institute at Chicago)

• A Pattern for Almost Compositional Functions
  Bjorn Bringert, Aarne Ranta (Chalmers University of Technology and Goteborg University)

• Modular Development of Certified Program Verifiers with a Proof Assistant
  Adam Chlipala (University of California, Berkeley)

• Abstraction Preservation and Subtyping in Distributed Languages
  Pierre-Malo Denielou, James J. Leifer (INRIA Rocquencourt)

• Transactional Events
  Kevin Donnelly (Boston University), Matthew Fluet (Cornell University)

• Modelling Deterministic Concurrent I/O
  Malcolm Dowse, Andrew Butterfield (Trinity College Dublin)

• Static Analysis for Syntax Objects
  David Fisher (Georgia Institute of Technology), Olin Shivers (Northeastern University)

• OCaml + XDuce
  Alain Frisch (INRIA Rocquencourt)

• Mechanized Meta-Reasoning Using a Hybrid HOAS/de Bruijn Representation and Reflection
  Jason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov (California Institute of Technology)

• Simple Unification-based Type Inference for GADTs
  Simon Peyton Jones (Microsoft Research) Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn (University of Pennsylvania)

• Algebraic Fusion of Functions with an Accumulating Parameter and Its Improvement
  Shin-ya Katsumata, Susumu Nishimura (Kyoto University)

• bixid: A bidirectional transformation language for XML
  Shinya Kawanaka (IBM Tokyo Research Laboratory), Haruo Hosoya (The University of Tokyo)

• Delimited Dynamic Binding
  Oleg Kiselyov (FNMOC), Chung-chieh Shan (Rutgers University), Amr Sabry (Indiana University)

• Programming Monads Operationally with Unimo
  Chuan-kai Lin (Portland State University)

• Improving Flow Analyses via Gamma-CFA: Abstract Garbage Collection and Counting
  Matthew Might (Georgia Institute of Technology), Olin Shivers (Northeastern University)

• Recursive Modules for Programming
  Keiko Nakata (University of Kyoto) and Jacques Garrigue (Nagoya University)

• Polymorphism and Separation in Hoare Type Theory
  Aleksandar Nanevski, Greg Morrisett (Harvard University) Lars Birkedal (IT University of Copenhagen)

• From Structures and Functors to Modules and Units
  Scott Owens, Matthew Flatt (University of Utah)

• Equality of Streams is a Pi_2^0-Complete Problem
  Grigore Rosu (University of Illinois at Urbana-Champaign)

• The Missing Link - Dynamic Components for ML
  Andreas Rossberg (Universitat des Saarlandes)

• Boxy Types: Inference for Higher-Rank Types and Impredicativity
  Dimitrios Vytiniotis, Stephanie Weirich (University of Pennsylvania) Simon Peyton Jones (Microsoft Research)

• Static Typing for a Faulty Lambda Calculus
  David Walker, Lester Mackey, Jay Ligatti, George A. Reis, David I. August (Princeton University)

• Stabilizers: A Modular Checkpointing Abstraction for Concurrent Functional Programs
  Lukasz Ziarek, Philip Schatz, Suresh Jagannathan (Purdue University)