1. ICFP 1996: Philadelphia, Pennsylvania
Robert Harper, Richard L. Wexelblat (Eds.): Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP '96), Philadelphia, Pennsylvania, May 24-26, 1996. ACM 1996 ISBN 0-89791-770-7, (SIGPLAN Notices 31(6), June 1996)
Session 1
Simon L. Peyton Jones, Will Partain, André Santos: Let-floating: Moving Bindings to Give Faster Programs. 1-12
Thérèse Hardin, Luc Maranget, Bruno Pagano: Functional Back-Ends within the Lambda-Sigma Calculus. 25-33
Session 2
Niklas Röjemo, Colin Runciman: Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited. 34-41
David S. Wise, Joshua Walgenbach: Static and Dynamic Partitioning of Pointers as Links and Threads. 42-49
Session 3
Chris Okasaki: The Role of Lazy Evaluation in Amortized Data Structures. 62-72
Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi: Deriving Structural Hylomorphisms From Recursive Definitions. 73-82
Session 4

Julia L. Lawall, Harry G. Mairson: Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? 92-101
Brian T. Howard: Inductive, Coinductive, and Pointed Types. 102-109
Session 5
Pedro Palao-Gostanza, Ricardo Pena, Manuel Núñez: A New Look to Pattern Matching in Abstract Data Types. 110-121
François Pottier: Simplifying Subtyping Constraints. 122-133
Giorgio Ghelli: Complexity of Kernel Fun Subtype Checking. 134-145
Session 6
Luc Moreau: The Semantics of Scheme with Future. 146-156
Franklyn A. Turbak: First-Class Synchronization Barriers. 157-168
Cormac Flanagan, Rishiyur S. Nikhil: pHluid: The Design of a Parallel Functional Language Implementation on Workstations. 169-179
Session 7
Peter Thiemann: Cogen in Six Lines. 180-189
Tyng-Ruey Chuang, Wen L. Hwang: A Probabilistic Approach to the Problem of Automatic Selection of Data Representations. 190-200
Session 8
William Ferreira, Matthew Hennessy, Alan Jeffrey: A Theory of Weak Bisimulation for Core CML. 201-212

Session 9
Shinn-Der Lee, Daniel P. Friedman: Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. 239-250




