Fifteenth Annual ACM Symposium on

Principles of Programming Languages

San Diego, January 13-15,1988


Forword | Organizing Committee | Papers Presented | Index

Foreword

    The papers in this volume were presented at the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. The program committee received 177 technical summaries in response to the call for papers. Of these, 28 were selected for presentation at the symposium. Technical excellence was, as usual, the primary criterion for selection. Topicality, readability, and overall balance of the program were also taken into consideration.
    Submissions were not formally refereed, but were reviewed by the program committee for selection for the symposium. Each summary was assigned to at least four specific members of the program committee for reading. However, every committee member received a copy of every summary, with strong encouragement to read more than the assigned number of summaries. The program chairman read every summary. This allocation of the workload allowed the other committee members to concentrate on technical summaries in their areas of expertise and devote the time necessary to understand them in depth, yet also guaranteed that any pair of summaries could be compared by at least one member of the committee. While every summary was read by at least four members of the program committee, on the average each summary was read by 5.1 members.

-top-

Organizing Committee

Conference Committee

Co-chairs

  • Jeanne Ferrante (IBM T. J. Watson Research Center)
  • Peter Mager (PSM Associates)
  • Registration

  • Karl Ottenstein (BBN Advanced Computers, Inc.)
  • Local Arrangements

  • Laurette Bradley (University of California, San Diego)
  • Treasurer

  • Lori Pollock (Rice University)
  • Publicity

  • John R. Sopka (Digital Equipment Corporation)
  • Design Consultant

  • Claire Albahae (IBM T. J. Watson Research Center)
  • Program Committee

  • Fran Allen (IBM T. J. Watson Research Center)
  • Jon Bentley (AT&T Bell Laboratories)
  • Robert Cartwright (Rice University)
  • William Clinger (Tektronix, Inc.)
  • Peter Deutsch (ParcPlace Systems)
  • Paul Hudak (Yale University)
  • Guy L. Steele Jr. (Thinking Machines Corporation), Chair
  • Tim Teitelbaum (Cornell University)
  • Mitchell Wand (Northeastern University)
  • William Weihl (MIT)
  • Michael Wolfe (Kuck and Associates)
  • -top-

    Papers Presented

    Tutorial: January 13 - David Mac Queen (AT&T Bell Laboratories)

  • The ML Type System

  • Session I: January 13 - Chaired by William Weihl
     

  • Detecting Equality of Variables in Programs

  •         Bowen Alpern, Mark N. Wegman (IBM T. J. Watson Research Center)
            F. Kenneth Zadeck (Eroum University)
     
  • Global Value Numbers and Redundant Computations

  •         Barry K. Rosen, Mark N. Wegman (IBM T. J. Watson Research Center)
            F. Kenneth Zadeck (Brown University)


    Session II: January 13 - Chaired by William Clinger
     

  • The Essence of ML

  •         John C. Mitchell (AT&T Bell Laboratories)
            Robert Harper (Edinburgh University)
     
  • Polymorphic Effect Systems

  •         John M. Lucassen, David K. Gifford (MIT Laboratory for Computer Science)
     
  • A Proper Extension of ML with an Effective Type-Assignment

  •         A. J. Kfoury (Boston University)
            J. Tiuryn, P. Urzyczyn (University of Warsaw)


    Session III: January 13 - Chaired by Peter Deutach
     

  • Structural Subtyping and the Notion of Power Type

  •         Luca Cardelli (Digital Equipment Corporation)
     
  • Inheritance in Smalltalk-80: A Denotational Definition

  •         Samuel Kamin (University of Illinois, Urbana-Champaign)
     
  • Type Inference with Subtypes

  •         Ryan Stansifer (Purdue University)


    Session IV: January 13 - Chaired by Robert Cartright
     

  • Automatic Binding Time Analysis for a Typed A-calculus

  •         Hanne R. Nielson (Aalborg University)
            Flemmiag Nielson (Technical University of Denmark)
     
  • A Collecting Interpretation of Expressions (without Powerdomains)

  •         Paul Hudak, Jonathan Young (Yale University)
     
  • Strictness Analysis Aids Time Analysis

  •         Philip Wadler (Glasgow University)


    Tutorial: January 14 - Daniel P. Friedman (Indiana University)

  • Applications of Continuations

  • Session V: January 14 - Chaired by Fran Allen
     

  • Integrating Non-Interfering Versions of Programs

  •         Susan Horwitz, Jan Prins, Thomas Reps (University of Wisconsin-Madison)
     
  • On the Adequacy of Program Dependence Graphs for Representing Programs

  •         Susan Horwitz, Jan Prins, Thomas Reps (University of Wisconsin-Madison)


    Session VI: January 14 - Chaired by Mitchell Wand
     

  • Stores and Partial Continuations as First-Class Objects in a Language and its Environment

  •         Gregory F. Johnson, Dominic Duggan (University of Maryland)
     
  • Sacrificing simplicity for convenience: Where do you draw the line?

  •         John H. Williams, Edward L. Wimmers (IBM Almaden Research Center)
     
  • The Theory and Practice of First-Class Prompts

  •         Matthias Felleisen (Indiana University)


    Session VII: January 14 - Chaired by Paul Hudak
     

  • Towards Fully Abstract Semantics for Local Variables: Preliminary Report

  •         Albert R. Meyer, Kurt Sieber (MIT Laboratory for Computer Science)
     
  • Correct Flow Analysis in Continuation Semantics

  •         Margaret Montenyohl (University of SW Louisiana)
            Mitchell Wand (Northeastern University)
     
  • Inductive Methods for Reasoning About Abstract Data Types

  •         Stephen J. Garland, John V. Guttag (MIT Laboratory for Computer Science)


    Session VIII: January 14 - Chaired by Jon Bentley
     

  • Bisimulation Can't be Traced: Preliminary Report

  •         Bard Bloom (MIT Laboratory for Computer Science)
            Sorin Istrail (Wesleyan University)
            Albert R. Meyer (MIT Laboratory for Computer Science)
     
  • A Compositional Approach to Superimposition

  •         L. Bouge (Universite d'Orleans)
            Nissim Francez (The Technion)
     
  • A Temporal Fixpoint Calculus

  •         Moshe Y. Vardi (IBM Almaden Research Center)


    Session IX: January 15th - Chaired by Tim Teitelbaum
     

  • Efficient Dataflow Analysis of Logic Programs

  •         Saumya K. Debray (University of Arizona)
     
  • Incremental Data Flow Analysis via Dominator and Attribute Update

  •         Martin D. Carroll, Barbara G. Ryder (Rutgers University)
     
  • Lifetime Analysis of Dynamically Allocated Objects

  •         Cristina Ruggieri (Purdue University)
            Thomas P. Murtagh (Williams College)


    Session X: January 15th - Chaired by Michael Wolfe
     

  • Optimal Code Generation for Expression Trees: An Application of BURS Theory

  •         Eduardo Pelegri-Llopart, Susan L. Graham (University of California, Berkeley)
     
  • Compiler Optimizations for Asynchronous Systolic Array Programs

  •         Monica Lam (Carnegie-Mellon University)
     
  • Supernode Partitioning

  •         F. Irigoin, R. Triolet (Ecole Nationale Superieure des Mines des Paris)
    -top-