23. POPL 1996: St. Petersburg Beach, Florida

Session 1

• Rakesh Ghiya, Laurie J. Hendren:
  Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C. 1-15
  
• Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm:
  Solving Shape-Analysis Problems in Languages with Destructive Updating. 16-31
  
• Bjarne Steensgaard:
  Points-to Analysis in Almost Linear Time. 32-41
  

Session 2

• Trevor Jim:
  What Are Principal Typings and What Are They Good For? 42-53
  
• Martin Odersky, Konstantin Läufer:
  Putting Type Annotations to Work. 54-67
  
• Mark P. Jones:
  Using Parameterized Signatures to Express Modular Structure. 68-78
  

Session 3

• Daniel Jackson, Somesh Jha, Craig Damon:
  Faster Checking of Software Specifications by Eliminating Isomorphs. 79-90
  
• Kannan Govindarajan, Bharat Jayaraman, Surya Mantha:
  Optimization and Relaxation in Constraint Logic Languages. 91-103
  
• Nicholas Pippenger:
  Pure versus Impure LISP. 104-109
  
• Andrea Asperti:
  On the Complexity of Beta-Reduction. 110-118
  

Session 4

• Todd A. Proebsting, Scott A. Watterson:
  Filter Fusion. 119-130
  
• Dawson R. Engler, Wilson C. Hsieh, M. Frans Kaashoek:
  `C: A Language for High-Level, Efficient, and Machine-Independent Dynamic Code Generation. 131-144
  
• Charles Consel, François Noël:
  A General Approach for Run-Time Specialization and its Application to C. 145-156
  

Session 5

• Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum:
  Discovering Auxiliary Information for Incremental Computation. 157-170
  
• Lars Birkedal, Mads Tofte, Magnus Vejlstrup:
  From Region Inference to von Neumann Machines via Region Representation Inference. 171-183
  
• J. Michael Ashley:
  A Practical and Flexible Flow Analysis for Higher-Order Languages. 184-194
  
• Christopher Colby, Peter Lee:
  Trace-Based Program Analysis. 195-207
  

Session 6

• Lal George, Andrew W. Appel:
  Iterated Register Coalescing. 208-218
  
• Roger Hoover, F. Kenneth Zadeck:
  Generating Machine Specific Optimizing Compilers. 219-229
  
• Steven M. Kurlander, Charles N. Fischer:
  Minimum Cost Interprocedural Register Allocation. 230-241
  

Session 7

• Olivier Danvy:
  Type-Directed Partial Evaluation. 242-257
  
• Rowan Davies, Frank Pfenning:
  A Modal Analysis of Staged Computation. 258-270
  
• Yasuhiko Minamide, J. Gregory Morrisett, Robert Harper:
  Typed Closure Conversion. 271-283
  
• Leonidas Fegaras, Tim Sheard:
  Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space). 284-294
  

Session 8

• Simon L. Peyton Jones, Andrew Gordon, Sigbjorn Finne:
  Concurrent Haskell. 295-308
  
• John Greiner, Guy E. Blelloch:
  A Provably Time-Efficient Parallel Implementation of Full Speculation. 309-321
  
• Manish Gupta, Edith Schonberg:
  Static Analysis to Reduce Synchronization Costs in Data-Parallel Programs. 322-332
  

Session 9

• Joachim Niehren:
  Functional Computation as Concurrent Computation. 333-343
  
• Kohei Honda:
  Composing Processes. 344-357
  
• Naoki Kobayashi, Benjamin C. Pierce, David N. Turner:
  Linearity and the Pi-Calculus. 358-371
  
• Cédric Fournet, Georges Gonthier:
  The Reflexive CHAM and the Join-Calculus. 372-385
  

Session 10

• Andrew D. Gordon, Gareth D. Rees:
  Bisimilarity for a First-Order Calculus of Objects with Subtyping. 386-395
  
• Martín Abadi, Luca Cardelli, Ramesh Viswanathan:
  An Interpretation of Objects and Object Types. 396-409
  
• John Hughes, Lars Pareto, Amr Sabry:
  Proving the Correctness of Reactive Systems Using Sized Types. 410-423