25. POPL 1998: San Diego, CA, USA

• John Hannan, Patrick Hicks:
  Higher-Order unCurrying. 1-11
  
• Saumya K. Debray, Robert Muth, Matthew Weippert:
  Alias Analysis of Executable Code. 12-24
  
• Bruno Blanchet:
  Escape Analysis: Correctness Proof, Implementation and Experimental Results. 25-37
  
• David A. Schmidt:
  Data Flow Analysis is Model Checking of Abstract Interpretations. 38-48
  
• Simon L. Peyton Jones, Mark Shields, John Launchbury, Andrew P. Tolmach:
  Bridging the Gulf: A Common Intermediate Language for ML and Haskell. 49-61
  
• Zena M. Ariola, Amr Sabry:
  Correctness of Monadic State: An Imperative Call-by-Need Calculus. 62-74
  
• Yasuhiko Minamide:
  A Functional Representation of Data Structures with a Hole. 75-84
  
• J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew:
  From System F to Typed Assembly Language. 85-97
  
• Denis Barthou, Albert Cohen, Jean-Francois Collard:
  Maximal Static Expansion. 98-106
  
• Kathleen Knobe, Vivek Sarkar:
  Array SSA Form and Its Use in Parallelization. 107-120
  
• Rakesh Ghiya, Laurie J. Hendren:
  Putting Pointer Analysis to Work. 121-133
  
• Thomas Ball, Peter Mataga, Shmuel Sagiv:
  Edge Profiling versus Path Profiling: The Showdown. 134-148
  
• Raymie Stata, Martín Abadi:
  A Type System for Java Bytecode Subroutines. 149-160
  
• Tobias Nipkow, David von Oheimb:
  Java_light is Type-Safe - Definitely. 161-170
  
• Matthew Flatt, Shriram Krishnamurthi, Matthias Felleisen:
  Classes and Mixins. 171-183
  
• Christian S. Collberg, Clark D. Thomborson, Douglas Low:
  Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs. 184-196
  
• Jens Palsberg, Christina Pavlopoulou:
  From Polyvariant Flow Information to Intersection and Union Types. 197-208
  
• Thomas P. Jensen:
  Inference of Polymorphic and Conditional Strictness Properties. 209-221
  
• Greg DeFouw, David Grove, Craig Chambers:
  Fast Interprocedural Class Analysis. 222-236
  
• Rastislav Bodík, Sadun Anik:
  Path-Sensitive Value-Flow Analysis. 237-251
  
• Benjamin C. Pierce, David N. Turner:
  Local Type Inference. 252-265
  
• Susumu Nishimura:
  Static Typing for Dynamic Messages. 266-278
  
• Aleksy Schubert:
  Second-Order Unification and Type Inference for Church-Style Polymorphism. 279-288
  
• Mark Shields, Tim Sheard, Simon L. Peyton Jones:
  Dynamic Typing as Staged Type Inference. 289-302
  
• Andrea Asperti, Harry G. Mairson:
  Parallel Beta Reduction is not Elementary Recursive. 303-315
  
• Zhenjiang Hu, Masato Takeichi, Wei-Ngan Chin:
  Parallelization in Calculational Forms. 316-328
  
• Suresh Jagannathan, Peter Thiemann, Stephen Weeks, Andrew K. Wright:
  Single and Loving It: Must-Alias Analysis for Higher-Order Languages. 329-341
  
• Alexander Aiken, David Gay:
  Barrier Inference. 342-354
  
• Geoffrey Smith, Dennis M. Volpano:
  Secure Information Flow in a Multi-Threaded Imperative Language. 355-364
  
• Nevin Heintze, Jon G. Riecke:
  The SLam Calculus: Programming with Secrecy and Integrity. 365-377
  
• James Riely, Matthew Hennessy:
  A Typed Language for Distributed Mobile Processes (Extended Abstract). 378-390
  
• Xavier Leroy, François Rouaix:
  Security Properties of Typed Applets. 391-403