Ninth Annual ACM Symposium on

Principals of Programming Languages

Albuquerque, January 25 27, 1982


Foreword | Organizing Committee | Papers Presented | Index

Foreword

    The papers in this volume were contributed for presentation at the Ninth Annual ACM SIGACT-SIGPLAN Symposium on Principals of Programming Languages, Albuquerque, New Mexico, January 25 - 27, 1982

    The papers in this Proceedings were selected on September 10, 1981 at a meeting of the Programming Committee from among 121 extended abstracts submitted in response to the Call for Papers.  In an attempt to experiment with the symposium format and respond to the growth in the field, the committee accepted a record thirty-eight papers for presentation at this year's symposium and has extended the meeting to three full days.  Selection was based on originality, technical merit and relevance.

    The papers in this Proceeding have not been formally refereed, and papers generally represent preliminary reports of continued research.  It is anticipated that most of these papers will appear in more polished and complete form in scientific journals.

    The conference organizers wish to thank all of those who submitted abstracts for consideration, those colleagues who helped in the evaluation of many of the abstracts, the sponsoring organizations for their assistance and support, and the many individuals who contributed to the success of the conference.  The Program Chairman is particularly grateful to Mr. Sinasi Bilsel of the Georgia Institute of Technology for his data processing assistance and Mrs. Esther Richards, also of Georgia Institute of Technology for her particularly dedicated assistance in handling the many details involved in the committee's work and for her help in assembling this proceeding.

-top-

Organizing Committee

Program Committee:

Richard DeMillo, Chairman
Robert Cartwright
Alan Demers
Christopher Fraser
William Harrison
Anita Jones
S. Rao Kosaraju
Harry Lewis
Michael Rabin
Olivier Roubine
William Rounds
 
Local Arrangements
 
Cleve Moler
 

-top-

Papers Presented
 
Session I: January 25, 1982 - Chaired by A. K. Jones (Carnegie-Mellon Univ.)
 
  • Termination of Probabilistic Concurrent Programs

  •         S. Hart
            M. Sharir (Tel Aviv Univ.)
            A. Pnueli (Weizmann Institute of Science)
     
  • Guardians and Actions: Linguistic Support for Robust, Distributed Programs

  •         B. Liskov
            R. Scheifler (MIT)
     
  • Specifications and Synthesis of Communicating Processes Using an Extended Temporal Logic (Preliminary Version)

  •         P. Wolper (Stanford Univ.)
     
  • Messages as Active Agents

  •         D. W. Wall (Pennsylvania State Univ.)
     
  • Extended Naming Conventions for Communicating Processes

  •         N. Francez (Technion)
     
  • Unbounded Speed Variability in Distributed Communication Systems

  •         J. Reif
            P. Spirakis (Harvard Univ.)
     
  • Programming Aspects of VLSI (Preliminary Version)

  •         R. J. Lipton
            J. Valdes (Princeton Univ.)
            R. Sedgewick (Brown Univ.)
     

    Session II: January 25, 1982 - Chaired by O. Roubine (CII Honeywell Bull)
     

  • A flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures

  •         N. D. Jones (Aarhus Univ.)
            S. S. Muchnick (Hewlett-Packard, Palo Alto)
     
  • Automatic Generation of Machine Specific Code Optimizers

  •         R. Geigerich (Technical Univ. of Munich)
     
  • Optimal Code for Control Structures

  •         M. V. S. Ramanth (Univ. of Western Ontario)
            M. Solomon (Univ. of Wisconsin-Madison)
     
  • Experience with an Attribute Grammar-Based Compiler

  •         R. Farrow (Intel Corp.)
     
  • Description-Driven Code Generation using Attribute Grammars

  •         M. Ganapathi
            C. N. Fischer (Univ. of Wisconsin-Madison)
     
  • Code Generation and Reorganization in the Presence of Pipeline Constraints

  •         J. L. Henley
            T. R. Gross (Stanford University)
     
  • Eliminating Redundant Object Code

  •         J. W. Davidson
            C. W. Fraser (Univ. of Arizona)
     

    Session III: January 26, 1982 - Chaired by A. Demers (Cornell Univ.)
     

  • A Type Declaration and Inference System for Smalltalk

  •         A. H. Borning  (Univ. of Washington)
            D. H. H. Ingalls  (Xerox, Palo Alto Research Center)
     
  • Lithe: A Language Combining A Flexible Syntax and Classes

  •         D. Sandberg  (Univ. of Washington)
     
  • Unified Dialogue Management in the Carousel System

  •         E. Sandwell  (Linkoping Univ.)
     
  • Maple: A Programming Language and Operating System

  •         P. J. Voda  (Univ. of Alberta)
     
  • Optimal-time Incremental Semantic Analysis for Syntax-directed Editors

  •         T. Reps  (Cornell Univ.)
     
  • Practical Error Recovery in LR Parsing

  •         S. Sippu
            E. Soisalon-Soininen  (Univ. of Helsinki)
     
  • Non-syntactic Attribute Flow in Language Based Editors

  •         G. F. Johnson
            C. N. Fischer  (Univ. of Wisconsin-Madison)
     
  • Building Friendly Parsers

  •         F. Jalili
            J. H. Gallier  (Univ. of Pennsylvania)
     

    Session IV: January 26, 1982 - Chaired by W. Rounds (Univ. of Michigan)
     

  • Principal Type Schemes for Functional Programs

  •         Damas
            R. Milner  (Edinburgh Univ.)
     
  • On the Composition of Processes

  •         V. R. Pratt (Stanford Univ.)
     
  • A Semantics-Directed Compiler Generator

  •         L. Paulson (Stanford Univ.)
     
  • Semantics-Directed Machine Architecture

  •         M. Wand (Indiana Univ.)
     
  • Completion Semantics and Interpreter Generation

  •         M. C. Henson
            R. Turner  (Univ. of Essex)
     
  • Partial Evaluation of a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog

  •         H. J. Komorowski  (Linkoping Univ.)
     

    Session V: January 25, 1982 - Chaired by R. Cartwright  (Rice Univ.)
     

  • A Logic for Expressions with Side Effects

  •         H. Boehm (Cornell Univ.)
     
  • An Axiomatic Treatment of Exception Handling

  •         S. Yemini  (New York Univ.)
     
  • Semantics and Correctness of a Query Languages Translation

  •         E. Gansner
            J. R. Horgan
            C. M. R. Kintala
            D. J. Moore
            P. Surko  (Bell-Laboratories, Murray Hill)
     
  • Algorithmic Program Diagnosis

  •         E. Y. Shapiro (Yale Univ.)
     
  • On Effective Axiomatizations of Hoare Logics

  •         E. M. Clarke  (Harvard Univ.)
            S. M. German  (MIT)
            J. Y. Halpern (Stanford Univ.)
     
  • Modular Verification of Concurrent Programs

  •         B. Hailpern (IBM, T. J. Watson Research Center)
            S. Owicki  (Stanford Univ.)
     

    Session VI: January 27, 1982 - Chaired by M. Rabin  (Harvard Univ.)
     

  • Axiomatic Definability and Completeness for Recursive Programs

  •         A. R. Meyer
            J. C. Mitchell  (MIT)
     
  • Is the Interesting Part of Process Logic Uninteresting?:  A Translation from PL to PDL

  •         R. Sherman
            A. Pnueli
            D. Harel  (The Weizmann Institute of Science)
     
  • On the Expressive Power of Query Languages for Relational Databases

  •         E. C. Cooper  (Univ. of California, Berkeley)
     
  • On the Ability of Structures to Store and Access Information

  •         A. Critcher  (Univ. of Iowa)
     
    -top-