Final Program

1996 ACM SIGPLAN International Conference on Functional Programming

Philadelphia, Pennsylvania, USA

May 24-26, 1996

The ACM SIGPLAN International Conference on Functional Programming (ICFP) is a new annual conference combining the established LISP and Functional Programming (LFP) and Functional Programming and Computer Architecture (FPCA) conferences. The conference is sponsored by ACM SIGPLAN in association with IFIP WG 2.8 and will take place in Philadelphia, Pennsylvania as part of the Federated Computing Research Conference (FCRC '96). A workshop on Functional Languages in the Introductory Computing Curriculum (FLIC) will be held on the morning of May 24 in connection with ICFP.

General Chair: Robert Harper (Carnegie Mellon University)

Program Chair: R. Kent Dybvig (Indiana University)

Program Committee:

Luca Cardelli (Digital SRC)
Olivier Danvy (Aarhus Univ.)
Matthias Felleisen (Rice Univ.)
Richard Gabriel (ParcPlace)
Paul Hudak (Yale Univ.)
John Launchbury (Oregon Grad. Inst.)
Peter Lee (CMU)
Atsushi Ohori (Kyoto Univ.)
Didier Remy (INRIA)
John Reppy (AT&T Research)
Olin Shivers (MIT)
Andrew Wright (NEC Research)

Joint reception with PLDI: 6:30-8:30 Thursday

The reception will include presentation of the SIGPLAN Distinguished Service Award.

Workshop: 9:15-12:50 Friday

Organizers: Matthias Felleisen (Rice University) and Christopher Haynes (Indiana University)

Functional Languages in the Introductory Computing Curriculum

Session 1: 2:00-3:30 Friday

Chair: Olivier Danvy (Aarhus University)

Let-floating: moving bindings to give faster programs
Simon Peyton Jones, Will Partain, and André Santos (University of Glasgow)

A reflection on call-by-value
Amr Sabry (University of Oregon) and Philip Wadler (University of Glasgow)

Functional back-ends within the lambda-sigma-calculus
Thérèse Hardin (LITP and INRIA Rocquencourt), Luc Maranget (INRIA Rocquencourt), and Bruno Pagano (LITP and INRIA Rocquencourt)

Session 2: 4:00-5:30 Friday

Chair: Olin Shivers (MIT)

Lag, drag, void and use -- heap profiling and space-efficient compilation revisited
Niklas Röjemo and Colin Runciman (University of York)

Static and dynamic partitioning of pointers as links and threads
David S. Wise and Joshua Walgenbach (Indiana University)

Storage use analysis and its applications
Manuel Serrano (University of Montreal & INRIA Rocquencourt) and Marc Feeley (University of Montreal)

Plenary Invited Speaker 8:00-9:00 Saturday

Computing is Interaction
Robin Milner (Cambridge)

Session 3: 9:30-10:30 Saturday

Chair: Paul Hudak (Yale University)

The role of lazy evaluation in amortized data structures
Chris Okasaki (Carnegie Mellon University)

Deriving structural hylomorphisms from recursive definitions
Zhenjiang Hu, Hideya Iwasaki, and Masato Takeichi (University of Tokyo)

Session 4: 11:00-12:30 Saturday

Chair: John Launchbury (Oregon Graduate Institute)

Analysis and caching of dependencies
Martín Abadi (Digital Systems Research Center), Butler Lampson (Microsoft), and Jean-Jacques Lévy (INRIA Rocquencourt)

Optimality and inefficiency: What isn't a cost model of the lambda calculus?
Julia L. Lawall (IRISA) and Harry G. Mairson (Brandeis University)

Inductive, coinductive, and pointed types
Brian T. Howard (Kansas State University)

Session 5: 2:00-3:30 Saturday

Chair: Didier Remy (INRIA)

A new look to pattern matching in abstract data types
Pedro Palao Gostanza, Ricardo Peña, and Manuel Núñez (Universidad Complutense de Madrid)

Simplifying subtyping constraints
François Pottier (ENS Paris & INRIA Rocquencourt)

Complexity of kernel Fun subtype checking
Giorgio Ghelli (Università di Pisa)

Session 6: 4:00-5:30 Saturday

Chair: Matthias Felleisen (Rice University)

The semantics of Scheme with future
Luc Moreau (University of Southampton)

First-class synchronization barriers
Franklyn Turbak (Wellesley College)

pHluid: The design of a parallel functional language implementation
Cormac Flanagan (Rice University) and Rishiyur S. Nikhil (Digital Equipment Corporation)

Plenary Invited Speaker 8:00-9:00 Sunday

The case for wireless overlay networks
Randy Katz (UC Berkeley)

Session 7: 9:30-10:30 Sunday

Chair: Peter Lee (Carnegie Mellon University)

Cogen in six lines
Peter J. Thiemann (Universität Tübingen)

A probabilistic approach to the problem of automatic selection of data representations
Tyng-Ruey Chuang and Wen L. Hwang (Academia Sinica, Taiwan)

Session 8: 11:00-12:30 Sunday

Chair: John Reppy (AT&T Research)

A theory of weak bisimulation for core CML
William Ferreira, Matthew Hennessy, and Alan Jeffrey (University of Sussex)

A provable time and space efficient implementation of NESL
Guy E. Blelloch and John Greiner (Carnegie Mellon University)

Synchronous Kahn networks
Paul Caspi (VERIMAG) and Marc Pouzet (McGill University)

Session 9: 2:00-3:30 Sunday

Chair: Andrew Wright (NEC Research)

Enriching the lambda calculus with contexts: toward a theory of incremental program construction
Shinn-Der Lee and Daniel P. Friedman (Indiana University)

Sharing code through first-class environments
Christian Queinnec (École Polytechnique & INRIA Rocquencourt) and David DeRoure (University of Southampton)

Mixin modules
Dominic Duggan and Constantinos Sourelis (University of Waterloo)