8. ICFP 2003: Uppsala, Sweden

• Thomas Knight Jr.:
  Conservation of information: applications in functional, reversible, and quantum computing. 1
  
• Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierstra:
  Scripting the type inference process. 3-13
  
• Matthias Neubauer, Peter Thiemann:
  Discriminative sum types locate the source of type errors. 15-26
  
• Didier Le Botlan, Didier Rémy:
  ML^F: raising ML to the power of system F. 27-38
  
• Vincent Simonet:
  An extension of HM(X) with bounded existential and universal data-types. 39-50
  
• Véronique Benzaken, Giuseppe Castagna, Alain Frisch:
  CDuce: an XML-centric general-purpose language. 51-63
  
• Michael Y. Levin:
  Compiling regular patterns. 65-77
  
• Rex L. Page:
  Software is discrete mathematics. 79-86
  
• James J. Leifer, Gilles Peskine, Peter Sewell, Keith Wansbrough:
  Global abstraction-safe marshalling with hash types. 87-98
  
• Gavin M. Bierman, Michael W. Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough:
  Dynamic rebinding for marshalling and update, with destruct-time? 99-110
  
• Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano:
  Iterative-free program analysis. 111-123
  
• Harry G. Mairson:
  From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. 125
  
• David Walker, Steve Zdancewic, Jay Ligatti:
  A theory of aspects. 127-139
  
• Andres Löh, Dave Clarke, Johan Jeuring:
  Dependency-style generic Haskell. 141-152
  
• Henrik Nilsson:
  Functional automatic differentiation with dirac impulses. 153-164
  
• Simon L. Peyton Jones, Alan F. Blackwell, Margaret M. Burnett:
  A user-centred approach to functions in Excel. 165-176
  
• Yukiyoshi Kameyama, Masahito Hasegawa:
  A sound and complete axiomatization of delimited continuations. 177-188
  
• Philip Wadler:
  Call-by-value is dual to call-by-name. 189-201
  
• Emmanuel Beffara, Vincent Danos:
  Disjunctive normal forms and local exceptions. 203-211
  
• Yitzhak Mandelbaum, David Walker, Robert Harper:
  An effective theory of type refinements. 213-225
  
• Tomoyuki Higuchi, Atsushi Ohori:
  A static type system for JVM access control. 227-237
  
• R. John M. Hughes, S. Doaitse Swierstra:
  Polish parsers, step by step. 239-248
  
• Geoffrey Washburn, Stephanie Weirich:
  Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism. 249-262
  
• Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay:
  FreshML: programming with binders made simple. 263-274
  
• Chiyan Chen, Hongwei Xi:
  Meta-programming through typeful code representation. 275-286
  
• Robert Ennals, Simon L. Peyton Jones:
  Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. 287-298
  
• Mitchell Wand:
  Understanding aspects: extended abstract. 299-300
  

Last update Tue May 21 16:57:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page