11. ICFP 2006: Portland, Oregon, USA

Session 1

• R. Kent Dybvig:
  The development of Chez Scheme. 1-12
  

Session 2

• Matthew Might, Olin Shivers:
  Improving flow analyses via GammaCFA: abstract garbage collection and counting. 13-25
  
• Oleg Kiselyov, Chung-chieh Shan, Amr Sabry:
  Delimited dynamic binding. 26-37
  
• David Walker, Lester W. Mackey, Jay Ligatti, George A. Reis, David I. August:
  Static typing for a faulty lambda calculus. 38-49
  

Session 3

• Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn:
  Simple unification-based type inference for GADTs. 50-61
  
• Aleksandar Nanevski, Greg Morrisett, Lars Birkedal:
  Polymorphism and separation in hoare type theory. 62-73
  
• Keiko Nakata, Jacques Garrigue:
  Recursive modules for programming. 74-86
  

Session 4

• Scott Owens, Matthew Flatt:
  From structures and functors to modules and units. 87-98
  
• Andreas Rossberg:
  The missing link: dynamic components for ML. 99-110
  
• David Fisher, Olin Shivers:
  Static analysis for syntax objects. 111-121
  

Session 5

• Marc Shapiro:
  Practical proofs of concurrent programs. 123
  

Session 6

• Kevin Donnelly, Matthew Fluet:
  Transactional events. 124-135
  
• Lukasz Ziarek, Philip Schatz, Suresh Jagannathan:
  Stabilizers: a modular checkpointing abstraction for concurrent functional programs. 136-147
  
• Malcolm Dowse, Andrew Butterfield:
  Modelling deterministic concurrent I/O. 148-159
  

Session 7

• Adam Chlipala:
  Modular development of certified program verifiers with a proof assistant. 160-171
  
• Jason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov:
  Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection. 172-183
  
• Grigore Rosu:
  Equality of streams is a Pi0 over 2-complete problem. 184-191
  

Session 8

• Alain Frisch:
  OCaml + XDuce. 192-200
  
• Shinya Kawanaka, Haruo Hosoya:
  biXid: a bidirectional transformation language for XML. 201-214
  

Session 9

• Richard S. Bird:
  Fifteen years of functional pearls. 215
  

Session 10

• Björn Bringert, Aarne Ranta:
  A pattern for almost compositional functions. 216-226
  
• Shin-ya Katsumata, Susumu Nishimura:
  Algebraic fusion of functions with an accumulating parameter and its improvement. 227-238
  
• Matthias Blume, Umut A. Acar, Wonseok Chae:
  Extensible programming with first-class cases. 239-250
  

Session 11

• Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones:
  Boxy types: inference for higher-rank types and impredicativity. 251-262
  
• Martín Abadi:
  Access control in a core calculus of dependency. 263-273
  
• Chuan-Kai Lin:
  Programming monads operationally with Unimo. 274-285
  
• Pierre-Malo Deniélou, James J. Leifer:
  Abstraction preservation and subtyping in distributed languages. 286-297
  

Last update Sat May 18 18:44:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page