7. ICFP 2002: Pittsburgh, Pennsylvania, USA

• Brad A. Myers:
  Towards more natural functional programming languages. 1
  
• Ralf Hinze:
  Bootstrapping one-sided flexible arrays. 2-13
  
• Janis Voigtländer:
  Concatenate, reverse and map vanish for free. 14-25
  
• Magnus Carlsson:
  Monads for incremental computing. 26-35
  
• Bryan Ford:
  Packrat parsing: : simple, powerful, lazy, linear time, functional pearl. 36-47
  
• Robert Bruce Findler, Matthias Felleisen:
  Contracts for higher-order functions. 48-59
  
• Atsushi Ohori, Kiyoshi Yamatodani:
  An interoperable calculus for external object access. 60-71
  
• Matthew Flatt:
  Composable and compilable macros: : you want it when? 72-83
  
• Danny Dubé, Marc Feeley:
  A demand-driven adaptive type analysis. 84-97
  
• Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard:
  Exception analysis for non-strict languages. 98-109
  
• Todd D. Millstein, Colin Bleckner, Craig Chambers:
  Modular typechecking for hierarchically extensible datatypes and functions. 110-122
  
• J. Strother Moore:
  Functional formal methods. 123
  
• Josef Svenningsson:
  Shortcut fusion for accumulating parameters & zip-like functions. 124-132
  
• Christoph Lüth, Neil Ghani:
  Composing monads using coproducts. 133-144
  
• Keith Hanna:
  Interactive visual functional programming. 145-156
  
• Arthur I. Baars, S. Doaitse Swierstra:
  Typing dynamic typing. 157-166
  
• Peter J. Stuckey, Martin Sulzmann:
  A theory of overloading. 167-178
  
• Matthias Neubauer, Peter Thiemann:
  Type classes with more higher-order polymorphism. 179-190
  
• Karl Crary, Joseph Vanderwaart:
  An expressive, scalable type theory for certified code. 191-205
  
• Aleksandar Nanevski:
  Meta-programming with names and necessity. 206-217
  
• Emir Pasalic, Walid Taha, Tim Sheard:
  Tagless staged interpreters for typed languages. 218-229
  
• Olivier Danvy, Mayer Goldberg:
  There and back again. 230-234
  
• Benjamin Grégoire, Xavier Leroy:
  A compiled implementation of strong reduction. 235-246
  
• Lars Thomas Hansen, William D. Clinger:
  An experimental study of renewal-older-first garbage collection. 247-258
  
• Bernard P. Serpette, Manuel Serrano:
  Compiling scheme to JVM bytecode: : a performance study. 259-270
  
• Martin Gasbichler, Michael Sperber:
  Final shift for call/cc: : direct implementation of shift and reset. 271-282
  
• Neil D. Jones, Arne J. Glenstrup:
  Program generation, termination, and binding-time analysis. 283
  

Last update Fri May 25 08:18:54 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page