Sixth Annual ACM Symposium on
Principles of Programming Languages
San Antonio, January 29-31, 1979
Program Committee's Report
| Organizing Committee | Papers
Presented | Index
Program
Committee's Report
The papers in this volume were presented at the sixth
annual ACM Symposium on Principals of Programming Languages, sponsored
jointly by SIGACT and SIGPLAN. These papers have not been formally
refereed. Revisions or expansions of some of them may eventually
appear in refereed journals. These 27 papers were selected from 146
summaries submitted in response to the call for papers. The committee
thanks all those who submitted summaries for their interest in POPL.
The submissions dealt with a number of topics, with so many on the
logic of program proving that this topic has been subdivided in the following
tabulation. For each topic, the fraction of submissions that were
accepted is indicated. This information reflects the committee's
evaluation of the submissions actually received. It does not necessarily
reflect any judgment on the intrinsic interest of any topic.
| algorithms (1/2 = .50 |
interprocedural DFA* (1/3 = .33) |
pointers (1/4 = .25) |
| assertion langs. (1/5 = .20) |
lang. design (1/15 = .067) |
prog. development (1/7 = .14 |
| attribute grammars (1/4 = .25 |
lattice theory (3/8 = .38) |
prog. metrics (0/4 = 0) |
| concurrency (5/19 = .26) |
logic programming (0/2 = 0) |
prog. proving*** (2/6 = .33) |
| coroutines (0/4 = 0) |
machine code (1/4 = .25) |
prog. schemes (1/2 = .50) |
| data types (2/14 = .14) |
miscellaneous (0/13 = 0) |
prog. by example (0/4 = 0) |
| dynamic logic (2/3 = .67) |
optimization** (4/6 = .67) |
relational databases (2/2 = 1) |
| exceptions (0/5 = 0) |
parsing (0/15 = 0) |
term rewriting**** (1/6 = .17) |
The sums of numbers add up to more than 27/146 because some papers
dealt with two topics equally. For this category of paper the fraction
is 3/11 = .27.
* DFA = data flow analysis.
** Since machine code is a separate topic, this refers to optimization
at language levels above that of machine code.
*** This refers to program proving not already covered by one of the
other topics.
**** This could also have been called simplification or subtree
replacement systems.
Program Committee:
Peter J. Downey
Alan J. Perlis
David Gries
Dennis M. Ritchie
Derek C. Oppen
Robert E. Tarjan
Barry K. Rossen, Chairman
-top-
Organizing
Committee
Conference Cochairmen
Alfred V. Aho
Bell Laboratories
Murray Hill, NJ 07974
Stephen N. Zilles
IBM Research
San Jose, CA 95193
Program Chairman
Barry K. Rosen
IBM Thomas J. Watson Research Center
Yorktown Heights, NY 10598
Local Arrangements Chairman
Aaron H. Konstam
Trinity University
San Antonio, TX 78284
Publicity Chairman
Jeffrey D. Ullman
Princeton University
Princeton, NJ 08540
-top-
Papers
Presented
Session I: January 29, 1979 - Chaired by Dennis M. Ritchie
(Bell Laboratories)
A Compact, Machine-Independant Peephole Optimizer
Christopher W. Fraser
(University of Arizona)
A PL/CV Precis
Robert L. Constable and
Scott Johnson (Cornwell University)
Automatic Improvement of Programs in Very High Level Languages
Amelia C. Fong (University
of Guelph)
An Efficient Way to Find the Side Effects of Procedure Calls and Aliases
of Variables
John Banning (Amdahl
Corporation)
Principals in Proving Concurrent Programs in Gypsy
Donald I. Good and Richard
M. Cohen (University of Texas and Austin)
The Evolution of List-Copying Algorithms
Stanley Lee (University
of California at Berkeley)
Susan L. Gerhart (University
of Southern California), and
Willem P. deRoever (University
of Utrecht)
Session II: January 29, 1979 - Chaired by Derek C. Oppen (Stanford
University)
First Order Programming Logic
Robert Cartwright (Cornell
University) and John McCarthy (Stanford University)
Recursion in Logics of Programs
David Harel (IBM Research)
Process Logic
Vaughan Pratt (Massachusetts
Institute of Technology)
The Logic of a Relational Data Manipulation Language
Marco A. Casanova and
Philip A. Bernstein (Harvard University)
Universality of Data Retrieval Languages
Alfred V. Aho (Bell Laboratories)
and Jeffrey D. Ullman (Princeton University)
Report from the Program Committee
Barry K. Rosen, program
chairman
Session III: January 30, 1979 - Chaired by Peter J. Downey
(University of Arizona)
Automatic Generation of Near-Optimal Translators for Non-Circular Attribute
Grammars
Rina Cohen and E. Harry
(Technion)
Space-Time Tradeoffs for Linear Recursion
J. E. Savage (Brown University)
and
Sowmitri Swam (University
of Illinois at Urbana-Champaign)
Characterization and Elimination of Redundancy in Recursive Programs
Norman H. Cohen (Harvard
University)
The Functional Power of Parameter Passage Mechanisms
Adrienne Critcher (Baylor
University)
Interpreter Generation Using Tree Pattern Matching
Christoph M. Hoffman
and Michael J. O'Donnell (Perdue University)
Specifying Programming Language Specifics
Irene Greif and Albert
Meyer (Massachusetts Institute of Technology)
Session IV: January 30, 1979 - Chaired by Alan J. Perlis (Yale
University)
Decisions for "Type" in APL
W. E. Gull and M. A.
Jenkins (Queen's University)
Automatic Data Structure Selection in SETL
Edmond Schonberg
(Illinois Institute of Technology)
Jacob T. Schwartz (New
York University), and
Micha Sharir (New York
University)
Synthesis of Resource Invariants for Concurrent Programs
Edmund M. Clarke (Harvard
University)
Sting Pattern Matching in Polynomial Time
Ken C. Liu (University
of Wisconsin and Milwaukee), and
Arthur C. Fleck (University
of Iowa)
Predicate Path Expressions
Sten Andler (Carnegie-Mellon
University)
Type Checking in an Imperfect World
Terrence C. Miller (University
of California at San Diego)
-top-