Fourteenth Annual ACM Symposium on

Principles of Programming Languages

Munich, January 21-23, 1987


Foreword | Organizing Committee | Papers Presented | Index

Foreword

    The papers in this volume were presented at the Fourteenth Annual ACM Symposium on Principles of Programming Languages, held January 21-23, 1987, in Munich. The program committee met at the University of Amsterdam on Thursday, September 11, and Friday, September 12, 1986. The Computer Science Department of the University of Amsterdam was our host. The department’s exceptional hospitality, and particularly the aid of Peter van Emde Boas and L. Torenvliet, contributed greatly to the pleasure and success of the meeting. The committee considered the 108 abstracts received by the extended deadline of August 22. The committee discussed each abstract individually, and accepted or rejected each by a plurality vote.  While issues of balance and size of the program
were discussed, they did not explicitly determine any decisions. The committee selected 29 papers for inclusion in the program.

Although standards for acceptance at POPL are quite high, and competition is great, the committee’s selection process is not one of formal refereeing. It is expected that some of the conference papers will be revised and submitted to refereed journals. While there were no referees, and all program decisions are the sole responsibility of the program committee, a number of colleagues consulted with committee members before the meeting on particular papers.

-top-

Organizing Committee

Conference Committee

Conference Chairs
Steve Muchnick, Sun Microsystems
Mark Wegman, IBM Ti. Watson Research Center

Program Chair
Michael J. O’Donnell, The University of Chicago
 
Publicity
Victor Miller IBM, T.J. Watson Research Center

Treasurer
John Sopka Digital Equipment Corporation

Local Arrangements
Manfred Paul. (assisted by Uta Weber) Technische Universitat Munchen

Program Committee
Gregory Andrews, University of Arizona
Marc Auslander, IBM Ti. Watson Research Center
Edmund Clarke, Carnegie-Mellon University
Harald Ganzinger, University of Dortmund
Neil Jones, University of Copenhagen
Gilles Kahn, INRIA Sophia-Antipolis
Alan Mycroft, Cambridge University
Fernando Pereira, SRI International
Thomas Reps, University of Wisconsin
Norihisa Suzuki, IBM Japan

-top-

Papers Presented
 
Session I: January 21st - Chaired by Gilles Kahn (INRIA Sophia-Antipolis)
 
  • Specification and verification of concurrent programs by V-automata

  •         Zohar Manna (Stanford University and Weizmann Institute of Science)
            Amir Pnueli (Wei.zmann Institute of Science)
     
  • Axioms for concurrent objects

  •         Maurice P. Herlihy , Jeannette M. Wing (Carnegie-Mellon University)
     
  • Completeness and incompleteness of trace-based network proof systems

  •         Jennifer Widom, David Gries , Fred B. Schneider (Cornell University)


    Session II: January 21st - Chaired by Marc Auslander (IBM T. J.. Watson Research Center)
     

  • Semantic parallelization: A practical exercise in abstract interpretation

  •         Pierre Jouvelot (University of Paris)
     
  • The concurrent logic programming language CP: Definition and operational semantics

  •         Vijay A. Saraswat (Carnegie-Mellon University)
     
  • Automatic decomposition of scientific programs for parallel execution

  •         Randy Allen, David Callahan, Ken Kennedy (Rice University)


    Session III: January 21st - Chaired by Fernando Pereira (SRI International)
     

  • Macro-by-example: Deriving syntactic transformations from their specifications

  •         Eugene E. Kohl becker (Indiana University)
            Mitchell Wand (Northeastern University
     
  • Binding performance at language design time

  •         Jiazhen Cai, Robert Paige (Rutgers University)
     
  • Environments as first class objects

  •         David Gelernter (Yale University)
            Suresh Jagannathan (M.I.T.)
            Thomas London (AT&T Bell Laboratories)
     
  • Constraint logic programming

  •         Joxan Jaffar, Jean-Louis Lassez (IBM T. J. Watson Research Center)
     


     
    Session IV: January 22nd - Chaired by Alan Mycroft (Cambridge University)
     
  • Strictness analysis and denotational abstract interpretation

  •         Flemming Nielson (Aalborg University Centre)
     
  • Compiling strictness into streams

  •         Cordelia V. Hall, David S. Wise (Indiana University)
     
  • On strictness and its analysis

  •         Tsung-Min Kuo, Prateek Mishra (SUNY at Stony Brook)


    Session V: January 22nd - Chaired by Michael J. O’Donnell (The University of Chicago)
     

  • A logic for partially specified data structures

  •         M. Drew Moshier, William C. Rounds (University of Michigan)
     
  • An improvement to bottom-up tree pattern matching

  •         David R. Chase (Rice University)
     
  • LUSTRE: A declarative language for real-time programming

  •         P. Caspi, D. Pilaud, N. Halbwachs, J. A. Plaice (University of Grenoble)
     

    Session VI: January 22nd - Chaired by Neil Jones (University of Copenhagen)
     

  • Appraising fairness in distributed languages

  •         Krzysztof R. Apt (University of Paris)
            Nissim Francez, Shmuel Katz (Technion-Israel Institute of Technology)
     
  • Concurrent transition system semantics of process networks

  •         Eugene W. Stark (SUNY at Stony Brook)
     
  • Semantics for concurrency without powerdomains

  •         Frank J. Oles (IBM T.J. Watson Research Center)
     
  • Full abstraction of a real-time denotational semantics for an OCCAM-like language

  •         C. Huizing, R. Gerth, W. P. deRoever (Eindhoven University of Technology)
     


     
    Session VII: January 23rd - Chaired by Edmund Clarke (Carnegie-Mellon University)
     
  • Computable values can be classical

  •         Val Breazu-Tannen, Albert R. Meyer (M.I.T.)
     
  • Skinny and fleshy failures of relative completeness

  •         Daniel Leivant (Carnegie-Mellon University)
            Tim Fernando (Stanford University)
     
  • Empty types in polymorphic lambda calculus

  •         Albert R. Meyer (M.I.T.)
            John C. Mitchell (AT&T Bell Labs)
            Eugenio Moggi (University of Edinburgh)
            Richard Statman (Carnegie-Mellon University)


    Session VIII: January 23rd - Chaired by Harald Ganzinger (University of Dortmund)
     

  • Scheduling arithmetic and load operations in parallel with no spilling

  •         David Bernstein (Technion-Israel Institute of Technology)
            Jeffrey M. Jaffe (IBM Tj. Watson Research Center)
            Michael Rodeh (IBM Israel Science Center)
     
  • Computation of aliases and support sets

  •         Anne Neirynck, Prakash Panangaden (Cornell University)
            Alan J. Demers (Xerox PARC)
     
  • A realistic compiler generator based on high-level semantics: Another progress report

  •         Peter Lee (University of Michigan)
            Uwe Pleban (PhiloSoft and University of Michigan)


    Session IX: January 23rd - Chaired by Thomas Reps (University of Wisconsin)
     

  • Extensions for multi-module records in conventional programming languages

  •         David R. Cheriton, Michael E. Wolf (Stanford University)
     
  • Views: A way for pattern matching to cohabit with data abstraction

  •         Philip Wadler (Oxford University)
     
  • A calculus for assignments in higher-order languages

  •         Matthias Felleisen, Daniel P. Friedman (Indiana University)
    -top-