Eighteenth Annual ACM Symposium on

Principles of Programming Languages

Orlando, January 21-23, 1991


Forword | Organizing Committee | Papers Presented | Index

Foreword

    The papers in this volume were presented at the Eighteenth Annual ACM Symposium on Principles of Programming Languages. The papers were selected by the program committee from a collection of 152 technical summaries submitted in response to a call for papers. The principal selection criteria were technical excellence, originality, and relevance to the subject of programming languages.  The submissions were not formally refereed, but were reviewed by the program committee for
publication in the conference. The program chair assigned each technical summary to at least four committee members based on the paper’s subject area and the members’ areas of expertise. In addition, every committee member received a copy of all of the summaries and reviewed as many summaries as possible.

-top-

Organizing Committee

Conference Committee

Conference Chair
David Wise (Indiana University)

Local Arrangements Chair
Carole Mann (Gentleware Corporation)

Treasurer
Justin Graver (University of Florida)

Program Chair
Robert (Corky) Cartwright (Rice University)

Program Committee
Hassan Ait-Kaci (DEC PRL)
Marina Chen (Yale University)
Alan Demers (Xerox PARC)
Carl Gunter (University of Pennsylvania)
David Jiarel (Weizmann Institute)
Jean-Jacques Levy (INRIA Rocquencourt)
John Mitchell (Stanford University)
Uday Reddy (University of Illinois)
Guy Steele (Thinking Machines)
John Williams (IBM Research, Almaden)
Dan Yellin (IBM Research, Yorktown Heights)

-top-

Papers Presented

Session I: January 21st - Chaired by John Williams (IBM Research, Almaden)
 

  • A Theory of Incremental Computation and its Application

  •         R.S. Sundaresh, Paul Hudak (Yale University)
     
  • Static and Dynamic Semantics Processing

  •         Charles Consel (Yale University),
            Olivier Danvy (Kansas State University)


    Session II: January 21st - Chaired by Alan Demers (Xerox PARC)
     

  • How to Make Destructive Updates Less Destructive

  •         Martin Odersky (IBM Research, Yorktown Heights)
     
  • On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation

  •         R.C. Sekar, Prateek Mishra, I.V. Ramakrishnan (SUNY Stony Brook)
     
  • A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions

  •         Samson Abramsky, Thomas P. Jensen (Imperial College)


    Session III: January 21st - Chaired by Dan Yellin (IBM Research, Yorktown Heights)
     

  • Automatic Construction of Sparse Data Flow Evaluation Graphs

  •         Jeanne Ferrante, Jong-Deok Choi, Ron Cytron (IBM Research, Yorktown Heights)
     
  • Dependence Flow Graphs: An Algebraic Approach to Program Dependencies

  •         Keshav Pingali, Micah Beck, Richard Johnson, Mayan Moudgill, Paul Stodghill (Cornell University)
     
  • Program Optimization and Parallelization Using Idioms

  •         Shlomit S. Pinter (Technion),
            Ron Y. Pinter (IBM Scientific Center, Technion)
     
  • Pointer- Induced Aliasing: A Problem Taxonomy

  •         William Landi, Barbara Ryder (Rutgers University)


    Session IV: January 21st - Chaired by John Mitchell (Stanford University)
     

  • Subtyping Recursive Types

  •         Roberto M. Amadio (Ecole Normale Superieure),
            Luca Cardelli (DEC SRC)
     
  • The Complexity of Type Inference for Higher-Order Lambda Calculi

  •         Fritz Henglein (New York University),
            Harry C. Mairson (Brandeis University)
     
  • A Record Calculus Based on Symmetric Concatenation

  •         Robert Harper, Benjamin Pierce (CMU)


    Session V: January 22nd - Chaired by Uday Reddy (University of Illinois)
     

  • Look Ma, No Hashing, and No Arrays Neither

  •         Jiazhen Cai, Robert A. Paige (New York University)
     
  • Macros That Work

  •         William Clinger (University of Oregon),
            Jonathan Rees (MIT)


    Session VI: January 22nd - Chaired by Guy Steele (Thinking Machines Corporation)
     

  • Typing First-Class Continuations in ML

  •         Bruce Duba (Rice University),
            Robert Harper (CMU),
            David MacQueen (AT&T Bell Laboratories)
     
  • A Dynamic Extent Control Operator for Partial Continuations

  •         Christian Queinec (Ecole Polytechnique),
            Bernard Serpette (INRIA Rocquencourt)
     
  • Models of Continuations without Continuations

  •         Dorai Sitaram, Matthias Felleisen (Rice University)


    Session VII: January 22nd - Chaired by Marina Chen (Yale University)
     

  • Parallel Programming with Coordination Structures

  •         Steven Lucco, Oliver Sharp (UC Berkeley)
     
  • Coordinating First-Order Multiparty Interactions

  •         Yuh-Jzer Joung, Scott A. Smolka (SUNY Stonybrook)
     
  • Communication with Directed Logic Variables

  •         Alon Kleinman, Yael Moscowitz, Amir Pnueli, Ehud Shapiro (Weizmann Institute)


    Session VIII: January 22nd - Chaired by Jean-Jacques Levy (INRIA Rocquencourt)
     

  • Parameter-Passing and the Lambda Calculus

  •         Erik Crank, Matthias Felleisen (Rice University)
     
  • Fully Abstract Translations Between Functional Languages

  •         Jon G. Riecke (MIT)
     
  • Optimal Derivations in Weak Lambda-calculi and in Orthogonal Term Rewriting Systems

  •         Luc Maranget (INRIA Rocquencourt)


    Session IX: January 23rd - Chaired by Carl Gunter (University of Pennsylvania)
     

  • An Extension of Standard ML Modules with Subtyping and Inheritance

  •         John Mitchell, Sigurd Meldal, Neel Madhav (Stanford University)
     
  • Static Type Inference in a Dynamically Typed Language

  •         Alex Aiken, Brian Murphy (IBM Research, Almaden)
     
  • Polymorphic Type Inference and Assignment

  •         Xavier Leroy, Pierre Weis (INRIA Rocquencourt)
     
  • Algebraic Reconstruction of Types and Effects

  •         Pierre Jouvelot, David Gifford (MIT)


    Session X: January 23rd - Chaired by Hassan Ait-Kaci (DEC PRL)
     

  • Modeling Concurrency with Geometry

  •         Vaughn Pratt (Stanford University)
     
  • A Logical View of Composition and Refinement

  •         Martin Abadi (DEC SRC),
            Gordon Plotkin (University of Edinburgh)
     
  • The Semantic Foundations of Concurrent Constraint Programming

  •         Vijay Saraswat (Xerox PARC),
            Martin Rinard (Stanford University),
            Prakash Panangaden (McGill University)
     
  • Temporal Proof Methodologies for Real-Time Systems

  •         Tom Henzinger, Zohar Manna (Stanford University),
            Amir Pnueli (Weizmann Institute)
    -top-