2. ICFP 1997: Amsterdam, The Netherlands

Session 1

• Anindya Banerjee: A Modular, Polyvariant, and Type-Based Closure Analysis. 1-10
• Allyn Dimock, Robert Muller, Franklyn A. Turbak, J. B. Wells: Strongly Typed Flow-Directed Representation Transformations. 11-24
• Jeffrey M. Bell, Françoise Bellegarde, James Hook: Type-Driven Defunctionalization. 25-37
• Kirsten Lackner Solberg Gasser, Flemming Nielson, Hanne Riis Nielson: Systematic Realisation of Control Flow Analyses for CML. 38-51

Session 2

• Martin Erwig: Functional Programming with Graphs. 52-65
• Chris Okasaki: Catenable Double-Ended Queues. 66-74
• Manuel Fähndrich, John Boyland: Statically Checkable Pattern Abstractions. 75-84

Session 3

• Zhong Shao: Flexible Representation Analysis. 85-98
• J. Michael Ashley: The Effectiveness of Flow Analysis for Inlining. 99-111
• Matthias Blume, Andrew W. Appel: Lambda-Splitting: A Higher-Order Approach to Cross-Module Optimizations. 112-124

Session 4

• Karl Crary: Foundations for the Implementation of Higher-Order Subtyping. 125-135
• Simon Marlow, Philip Wadler: A Practical Subtyping System For Erlang. 136-149
• Nevin Heintze, David A. McAllester: On the Complexity of Set-Based Analysis. 150-163

Session 5

• Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, Akihiko Takano: Tupling Calculation Eliminates Multiple Data Traversals. 164-175
• Wei-Ngan Chin, Masami Hagiya: A Bounds Inference Method for Vector-Based Memoisation. 176-187
• Julia L. Lawall, Harry G. Mairson: on Global Dynamics of Optimal Graph Reduction. 188-195

Invited Talk

• Joe L. Armstrong: The Development of Erlang. 196-203

Session 6

• Dirk Dussart, John Hughes, Peter Thiemann: Type Specialization for Imperative Languages. 204-216
• Koji Kagawa: Compositional References for Stateful Functional Programming. 217-226
• John Launchbury, Amr Sabry: Monadic State: Axiomatization and Type Safety. 227-238

Session 7

• Scott Draves: Implementing Bit-addressing with Specialization. 239-250
• Koen Claessen, Ton Vullinghs, Erik Meijer: Structuring Graphical Paradigms in TkGofer. 251-262
• Conal Elliott, Paul Hudak: Functional Reactive Animation. 263-273

Session 8

• Olin Shivers: Automatic Management of Operating System Resources. 274-279
• Cristian Ungureanu, Benjamin Goldberg: Formal Models of Distributed Memory Management. 280-291
• Michael W. Hicks, Jonathan T. Moore, Scott Nettles: The Measured Cost of Copying Garbage Collection Mechanisms. 292-305

Posters

• Kris Aerts, Karel De Vlaminck: A GUI on Top of a Functional Language. 308
• Koen Claessen: Graphs in Compilation. 309
• Byron Cook, John Launchbury: Disposable Memo Functions (Extended Abstract). 310
• Chris Dornan: Affordable Dynamic Types. 311
• Étienne Duris: Functional Programming and Attribute Grammars Deforestation. 312
• Natalio Krasnogor, Pablo E. Martínez López, Pablo Mocciola, David A. Pelta: Protien Folding meets Functional Programming. 313
• Natalio Krasnogor, Pablo E. Martínez López, Pablo Mocciola, David A. Pelta: Modelling String Folding with G2L Grammars. 314
• Eero Lassila: A Functional Macro Expansion System for Optimizing Code Generation: Gaining Context-Sensitivity without Losing Confluence. 315
• Bruce J. McAdam: BigTypes in ML. 316
• Cristóbal Pareja-Flores, J. Ángel Velázquez-Iturbide: Synthesis of Functions by Transformations and Constraints. 317
• Gilles Richard, Frédéric Saubion, A. Tellez-Arenas: Intensional Sets Using Explicit Substitutions. 318
• Viktor K. Sabelfeld, Andrei Sabelfeld: Simple Semantic Analysis Problems for Functional Programs. 319
• Eleni Spiliopoulou, Ian Holyer, Neil Davies: Distributed Programming, a Purely Functional Approach. 320
• Walid Taha, Tim Sheard: Multi-Stage Programming. 321
• Guilhem de Wailly: Lambda-Flow: A Parallel Functional Synchronous Dataflow Language. 322
• Bjarte M. Østvold: Inductive Synthesis of Recursive Functional Programs (Poster Abstract). 323