15. POPL 1988: San Diego, California

• Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck:
  Detecting Equality of Variables in Programs. 1-11
  
• Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck:
  Global Value Numbers and Redundant Computations. 12-27
  
• John C. Mitchell, Robert Harper:
  The Essence of ML. 28-46
  , long version: TOPLAS 15(2): 211-252 (1993)
• John M. Lucassen, David K. Gifford:
  Polymorphic Effect Systems. 47-57
  
• A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
  A Proper Extension of ML with an Effective Type-Assignment. 58-69
  
• Luca Cardelli:
  Structural Subtyping and the Notion of Power Type. 70-79
  
• Samuel N. Kamin:
  Inheritance in Smalltalk-80: A Denotational Definition. 80-87
  
• Ryan Stansifer:
  Type Inference with Subtypes. 88-97
  
• Hanne Riis Nielson, Flemming Nielson:
  Automatic Binding Time Analysis for a Typed Lambda-Calculus. 98-106
  
• Paul Hudak, Jonathan Young:
  A Collecting Interpretation of Expressions (Without Powerdomains). 107-118
  , long version: TOPLAS 13(2): 269-290 (1991)
• Philip Wadler:
  Strictness Analysis Aids Time Analysis. 119-132
  
• Susan Horwitz, Jan Prins, Thomas W. Reps:
  Integrating Non-Interfering Versions of Programs. 133-145
  
• Susan Horwitz, Jan Prins, Thomas W. Reps:
  On the Adequacy of Program Dependence Graphs for Representing Programs. 146-157
  
• Gregory F. Johnson, Dominic Duggan:
  Stores and Partial Continuations as First-Class Objects in a Language and its Environment. 158-168
  
• John H. Williams, Edward L. Wimmers:
  Sacrificing Simplicity for Convenience: Where Do You Draw the Line? 169-179
  
• Matthias Felleisen:
  The Theory and Practice of First-Class Prompts. 180-190
  
• Albert R. Meyer, Kurt Sieber:
  Towards Fully Abstract Semantics for Local Variables. 191-203
  
• Margaret Montenyohl, Mitchell Wand:
  Correct Flow Analysis in Continuation Semantics. 204-218
  
• Stephen J. Garland, John V. Guttag:
  Inductive Methods for Reasoning about Abstract Data Types. 219-228
  
• Bard Bloom, Sorin Istrail, Albert R. Meyer:
  Bisimulation Can't Be Traced. 229-239
  , long version: JACM 42(1): 232-268 (1995)
• Luc Bougé, Nissim Francez:
  A Compositional Approach to Superimposition. 240-249
  
• Moshe Y. Vardi:
  A Temporal Fixpoint Calculus. 250-259
  
• Saumya K. Debray:
  Efficient Dataflow Analysis of Logic Programs. 260-273
  
• Martin D. Carroll, Barbara G. Ryder:
  Incremental Data Flow Analysis via Dominator and Attribute Updates. 274-284
  
• Cristina Ruggieri, Thomas P. Murtagh:
  Lifetime Analysis of Dynamically Allocated Objects. 285-293
  
• Eduardo Pelegrí-Llopart, Susan L. Graham:
  Optimal Code Generation for Expression Trees: An Application of BURS Theory. 294-308
  
• Monica S. Lam:
  Compiler Optimizations for Asynchronous Systolic Array Programs. 309-318
  
• François Irigoin, Rémi Triolet:
  Supernode Partitioning. 319-329