Day 1, Monday, January 19, 1998 Invited Talk: 9:00-10:00.
Where Theory and Practice Meet: POPL Past and Future
John Reynolds, Carnegie Mellon University.Session 1: 10:30-12:30. Chaired by Neil Jones, University of Copenhagen.
Higher-Order UnCurrying
John Hannan and Patrick HicksAlias Analysis of Executable Code
Samya Debray, Robert Muth and Matthew WeippertEscape Analysis: Correctness Proof, Implementation and Experimental Results
Bruno BlanchetData Flow Analysis is Model Checking of Abstract Interpretations
David A. SchmidtSession 2: 14:00-16:00. Chaired by Atsushi Ohori, Kyoto University.
Bridging the Gulf: a Common Intermediate Language for ML and Haskell
Simon Peyton Jones, John Launchbury, Mark Shields and Andrew TolmachCorrectness of Monadic State: An Imperative Call-by-Need Calculus
Zena M. Ariola and Amr SabryA Functional Representation of Data Structures with a Hole
Yasuhiko MinamideFrom System F to Typed Assembly Language
Greg Morrisett, David Walker, Karl Crary, and Neal GlewSession 3: 16:30-18:30. Chaired by Jeanne Ferrante, University of California, San Diego.
Maximal Static Expansion
Denis Barthou, Albert Cohen and Jean-François CollardArray SSA Form and its Use in Parallelization
Kathleen Knobe and Vivek SarkarPutting Pointer Analysis to Work
Rakesh Ghiya and Laurie J. HendrenEdge Profiling versus Path Profiling: The Showdown
Thomas Ball, Peter Mataga and Mooly SagivReception: 19:00-20:30.
Invited Talk: 20:30-21:30.
From Principles to Programming Languages
Gérard Berry, École des Mines and INRIA, Sophia-Antipolis.
Day 2, Tuesday, January 20, 1998 Invited Talk: 9:00-10:00.
Global Trends in Flow Analysis
Mark Wegman, IBM.Session 4: 10:30-12:30. Chaired by Martin Odersky, University of South Australia.
A Type System for Java Bytecode Subroutines
Raymie Stata and Martín AbadiJava-light is Type-Safe -- Definitely
Tobias Nipkow and David von OheimbClasses and Mixins
Matthew Flatt, Shriram Krishnamurthi and Matthias FelleisenManufacturing Cheap, Resilient, and Stealthy Opaque Constructs
Christian Collberg, Clark Thomborson and Douglas LowSession 5: 14:00-16:00. Chaired by Nevin Heintze, Bell Laboratories, Lucent Technologies.
From Polyvariant Flow Information to Intersection and Union Types
Jens Palsberg and Christina PavlopoulouInference of Polymorphic and Conditional Strictness Properties
Thomas P. JensenFast Interprocedural Class Analysis
Greg DeFouw, David Grove and Craig ChambersPath-Sensitive Value-Flow Analysis
Rastislav Bodík and Sadun AnikSession 6: 16:30-18:30. Chaired by Xavier Leroy, INRIA, Rocquencourt.
Local Type Inference
Benjamin C. Pierce and David N. TurnerStatic Typing for Dynamic Messages
Susumu NishimuraSecond-order Unification and Type Inference for Church-style Polymorphism
Aleksy SchubertDynamic Typing as Staged Type Inference
Mark Shields, Tim Sheard and Simon Peyton Jones
Day 3, Wednesday, January 21, 1998 Invited Talk: 9:00-10:00.
Proofs, Types, and Safe Mobile Code
Peter Lee, Carnegie Mellon University.Session 7: 10:30-12:30. Chaired by Davide Sangiorgi, INRIA, Sophia-Antipolis.
Parallel Beta Reduction is not Elementary Recursive
Andrea Asperti and Harry G. MairsonParallelization in Calculational Forms
Zhenjiang Hu, Masato Takeichi and Wei-Ngan ChinSingle and Loving it: Must-Alias Analysis for Higher-Order Languages
Suresh Jagannathan, Peter Thiemann, Stephen Weeks and Andrew WrightBarrier Inference
Alexander Aiken and David GaySession 8: 14:00-16:00. Chaired by Andrew D. Gordon, University of Cambridge.
Secure Information Flow in a Multi-Threaded Imperative Language
Geoffrey Smith and Dennis VolpanoThe SLam Calculus: Programming with Secrecy and Integrity
Nevin Heintze and Jon G. RieckeA Typed Language for Distributed Mobile Processes
James Riely and Matthew HennessySecurity Properties of Typed Applets
Xavier Leroy and François Rouaix