ICFP 2003 Program

Affiliated with PLI 2003
August 25-29, 2003
Uppsala, Sweden

Monday 25 August 2003

Invited talk: 9:00–10:00

Conservation of information: Applications in functional, reversible, and quantum computing
Thomas Knight, Jr. (MIT Artificial Intelligence Laboratory)

Session I: 10:30–12:30

Scripting the type-inference process
Bastiaan Heeren, Jurriaan Hage, Doaitse Swierstra (Universiteit Utrecht)
Discriminative sum types locate the source of type errors
Matthias Neubauer, Peter Thiemann (Universität Freiburg)
MLF: Raising ML to the power of System F
Didier Le Botlan, Didier Rémy (INRIA Rocquencourt)
An extension of HM(X) with bounded existential and universal data-types
Vincent Simonet (INRIA Rocquencourt)

Session II: 2:15–3:45

CDuce: an XML-centric general-purpose language
Véronique Benzaken (LRI, Université Paris Sud, Orsay), Giuseppe Castagna (CNRS, LIENS, École Normale Supérieure), Alain Frisch (LIENS, École Normale Supérieure, Paris)
Compiling regular patterns
Michael Levin (University of Pennsylvania)
Software is discrete mathematics
Rex Page (University of Oklahoma)

Session III: 4:15–6:00

Global abstraction-safe marshalling with hash types
James Leifer (INRIA Rocquencourt), Gilles Peskine (INRIA Rocquencourt), Peter Sewell (University of Cambridge), Keith Wansbrough (University of Cambridge)
Dynamic rebinding for marshalling and update, with destruct-time lambda
Gavin Bierman (University of Cambridge), Michael Hicks (University of Maryland, College Park), Peter Sewell (University of Cambridge), Gareth Stoyle (University of Cambridge), Keith Wansbrough (University of Cambridge)
Iterative-free program analysis
Mizuhito Ogawa (Japan Advanced Institute of Science and Technology), Zhenjiang Hu (University of Tokyo), Isao Sasano (Japan Advanced Institute of Technology and Science)
Report on ICFP 2003 & 2004
Olin Shivers & Kathleen Fisher

Tuesday 26 August 2003

Invited talk: 9:00–10:00

From Hilbert space to Dilbert space: Context semantics as a language for games and flow analysis
Harry Mairson (Brandeis University)

Session IV: 10:30–12:30

A theory of aspects
David Walker (Princeton University), Steve Zdancewic (University of Pennsylvania), Jay Ligatti (Princeton University)
Dependency-style Generic Haskell
Andres Löh, Dave Clarke, Johan Jeuring (Universiteit Utrecht)
Functional automatic differentiation with Dirac impulses
Henrik Nilsson (Yale University)
A user-centred approach to functions in Excel
Simon Peyton Jones (Microsoft Research), Alan Blackwell (University of Cambridge), Margaret Burnett (Oregon State University)

Session V: 2:15–3:45

A sound and complete axiomatization of delimited continuations
Yukiyoshi Kameyama (University of Tsukuba), Masahito Hasegawa (Kyoto University)
Call-by-value is dual to call-by-name
Philip Wadler (Avaya Labs)
Disjunctive normal forms and local exceptions
Emmanuel Beffara (Université Paris 7), Vincent Danos (CRNS, Université Paris 7)

Session VI: 4:15–6:00

An effective theory of type refinements
Yitzhak Mandelbaum (Princeton University), David Walker (Princeton University), Robert Harper (Carnegie Mellon University)
A static type system for JVM access control
Tomoyuki Higuchi, Atsushi Ohori (Japan Advanced Institute of Science and Technology)
Parsing polish, step by step (functional pearl)
John Hughes (Chalmers University), Doaitse Swierstra (Universiteit Utrecht)
Programming contest awards presentation
Koen Claessen, Nils Anders Danielsson, Niklas Een, Daniel Hedin, John Hughes, Ulf Norell, Karol Ostrovsky, Josef Svenningsson, Tapani Utriainen (Chalmers University of Technology)

Wednesday 27 August 2003

Session VII: 9:00–10:30

Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
Geoffrey Washburn, Stephanie Weirich (University of Pennsylvania)
FreshML: Programming with binders made simple
Mark Shinwell, Andrew Pitts, Murdoch Gabbay (University of Cambridge)
Meta-programming through typeful code representation
Chiyan Chen, Hongwei Xi (Boston University)

Session VIII: 11:00–11:30

Optimistic evaluation: An adaptive evaluation strategy for non-strict programs
Robert Ennals (University of Cambridge), Simon Peyton Jones (Microsoft Research)

Invited talk (joint with PPDP '03 ): 11:30–12:30

Understanding aspects
Mitchell Wand (Northeastern University)