Eleventh Annual ACM Symposium
on
Principals of Programming Languages
Salt Lake City, 15-18 1984
Organizing Committee
| Papers Presented | Index
Organizing
Committee
Conference Co-chairs
Mary S. Van Deusen (IBM Research Center)
Larry Landweber (University of Wisconsin)
Program Chair
Ken Kennedy (Rice University)
Program Committee
Alan Borning (University of Washington)
E. M. Clark (Carnegie-Mellon University)
Stuart Feldman (Bell Laboratories)
Harald Ganzinger (TU Munich)
Ken Kennedy (Rice University)
Rao Kosaroju (John Hopkins)
David MacQueen (Bell Laboratories)
James Mitchell (Xerox)
Brian K. Reid (Stanford University)
Marvin Solomon (University of Wisconsin)
John Williams (IBM)
David Wise (Oregon State University)
Local Arrangements Chair
P. A. Subrahmanyam (University of Utah)
Conference Staff
Vicky Jackson (University of Utah)
Allison Richards (University of Utah)
Leah Stratman (Rice University)
-top-
Papers
Presented
Session I: January 16, 1984 - Chaired by Brian K. Reid (Stanford
Univ.)
Expressional Loops
Richard C. Waters (Massachusetts
Institute of Technology)
Grids: A New Program Structuring Mechanism Based on Layered Graphs
Harold Ossher (Stanford
Univ.)
Reflection and Semantics in LISP
Brian Cantwell Smith
(Xerox PARC)
Session II: January 16, 1984 - Chaired by E. M. Clark (Carnegie-Mellon
Univ.)
Interactive Proof Checking
Thomas Reps
Bowen Alpern (Cornell
Univ.)
Generalized Fair Termination
Nissim Francez (Technicon-Israel
Institute of Technology)
Dexter Kozen (IBM Research)
Temporal Verification of Carrier-sense Local Area Network Protocols
D. E. Shasha (Harvard
Univ. and IBM)
A. Pnueli (Harvard Univ.
and Weizmann Institute)
W. Ewald (Oxford Univ.)
Session III: January 16, 1984 - Chaired by David MacQueen
(Bell Laboratories)
Efficient Applicative Data Types
Eugene W. Myers (The
Univ. of Arizona)
Stop Losing Sleep Over Incomplete Data Type Specification
Jean Jacques Thiel (Centre
de Rescherche en Informatique de Nancy)
Completion of a Set of Rules Modulo a Set of Equation
Jean-Pierre Jouannaud
Helene Kirchner (Centre
de Rescherche en Informatique de Nancy)
Session IV: January 16, 1984 - Chaired by John Williams (IBM
Research)
Systems Programming in Concurrent Prolog
Ehud Shapiro (The Weizmann
Institute of Science)
Constraining-unification and the Programming Language Unicorn
Robert G. Bandes (Univ.
of Washington)
Implementation of a Interpreter for Abstract Equations
Christoph M. Hoffmann
Michael J. O'Donnell
(Perdue Univ.)
A Combinator-based Compiler for a Functional Language
Paul Hudak
David Kranz (Yale Univ.)
Session V: January 17, 1984 - Chaired by Marvin Solomon (Univ.
of Wisconsin)
Treat-an Applicative Code Generator
Jerald S. Schwartz
Dean Rubine (Bell Laboratories)
Inverse Currying Transformation on Attribute Grammars
Reinhard Wilhelm (Univ.
of California, Berkeley)
The Global Storage Needs of a Subcomputation
Jean-Claude Raoult (Univ.
of Paris)
Ravi Sethi (Bell
Laboratories)
Session VI: January 17, 1984 - Chaired by James Mitchell (Xerox
PARC)
A Types-as-sets Semantics for Milner-style Polymorphism
Mitchell Wand (Indiana
University)
An Ideal Model for Recursive Polymorphic Types
David MacQueen (Bell
Laboratories)
Gordon Plotkin (Univ.
of Edinburgh)
Ravi Sethi (Bell Laboratories)
Coercion and Type Inference
John C. Mitchell (Bell
Laboratories)
Session VII: January 17, 1984 - Chaired by Stuart Feldman
(Bell Laboratories)
Editing by Example
Robert Nix (Yale Univ.)
Direct Implementation of Compiler-specifications or the Pascal P-code Compiler
Revisited
Don Milos
Uwe Pleban
George Loegel (Univ.
of Michigan)
Paragon: Novel Uses of Type Hierarchies for Data Abstraction
Mark Sherman (Dartmouth
College)
Session VIII: January 17, 1984 - Chaired by Stuart Feldman
(Bell Laboratories)
Applicative Programming and Digital Design
Steven D. Johnson (Indiana
Univ.)
Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional
and Logic Programs
P. A. Subrahmanyam
J-H You (Univ. of Utah)
Static Inference of Properties of Applicative Programs
Prateek Mishra
Robert M. Keller (Univ.
of Utah)
Session IX: January 18, 1984 - Chaired by Rao Kosaraju (John
Hopkins Univ.)
The Semantics of Local Storage, or What Makes the Free-list Free?
Joseph Y. Halpern (IBM
Research)
Albert R. Meyer (Massachusetts
Institute of Technology)
B. A. Trakhtenbrot (Tel
Aviv Univ.)
On Relative Completeness of Programming Logics
Michal Grabowski (Univ.
of Warsaw)
A Good Hoare Axiom System for Algol-like Language
Joseph Y. Halpern (IBM
Research)
Session X: January 18,1984 - Chaired by Alan Borning (Univ.
of Washington)
A Hierarchical Basis for Reordering Transformations
Joe Warren (IBM Research)
A Less Dynamic Memory Allocation Scheme for Algol-like Languages
Thomas P. Murtagh (Purdue
Univ.)
Creating Efficient Systems for Object-oriented Languages
Norihisa Suzuki
Minoru Terada (The Univ.
of Tokyo)
Efficient Implementation of the Smalltalk-80 System
L. Peter Deutsch (Xerox
PARC)
-top-