Twenty-first ACM SIGPLAN-SIGACT
Symposium on
Principles of Programming Languages®
Portland, January 17-21, 1994
Forword | Organizing
Committee | Papers Presented | Index
Foreword
This volume contains 39 papers presented at the
Twenty-First Annual ACM Symposium on Principles of Programming Languages.
The papers were selected by the program committee from a collection of
173 technical summaries submitted in response to a call for papers. The
principal selection criteria were originality, significance, correctness,
and clarity. The submissions were not formally refereed, but were
reviewed by the program committee for presentation at the conference. The
program chair assigned each technical summary to at least three 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. Every committee member attended
the two day meeting at which the program was chosen. The symposium
was preceded by two half-day tutorials. Advanced tutorial lectures were
given at the beginning of each of the first two days of the symposium.
-top-
Organizing
Committee
Conference Committee
Conference Co-Chairs
Bernard Lang (INRIA Rocquencourt)
Daniel Yellin (IBM Watson Research Center)
Local Arrangements Chair
Tim Sheard (Oregon Graduate Institute)
Treasurer
John Field (IBM Watson Research Center)
Program Chair
Hans-J. Boehm (Xerox PARC)
Program Committee
Bob Ballance (Object Science Corp. and University of New Mexico)
Gerard Berry (Ecole des Mines, Sophia-Antipolis)
Luca Cardelli (DEC Systems Research Center)
Marina Chen (Yale University)
Rodney Farrow (Declarative Systems)
Peter Lee (Carnegie Mellon University)
John Launchbury (Glasgow University)
Dale Miller (University of Pennsylvania)
Willliam Pugh (University of Maryland)
Vivek Sarkar (IBM Santa Teresa Lab.)
Carolyn Talcott (Stanford University)
Kenny Zadeck (IBM T.J.Watson Research)
-top-
Papers
Presented
Session I: January 17 - Chaired by Vivek Sarkar (IBM Santa
Teresa Lab.)
Memory Subsystem Performance of Programs Using Copying Garbage Collection
Amer Diwan, David Tarditi,
Eliot Moss (Carnegie-Mellon University)
Correctness of Trap-Based Breakpoint Implementations
Norman Ramsey, (Bell
Communications Research)
Dominators, Super Blocks, and Program Coverage
Hiralal Agrawal (Bell
Communications Research)
Session II: January 17 - Chaired by Peter Lee (Carnegie-Mellon
University)
The Typed Polymorphic Label-Selective A-Calculus
Jaques Garrigue (The
University of Tokyo)
Hassan Ait Kaci (DEC
Paris Research Laboratory)
A Functional Theory of Local Names
Martin Odersky (Universitat
Karlsruhe)
From to a Journey Through Calculi of Explicit Substitutions
Pierre Lescanne (Centre
de Recherche en Informatique de Nancy and INRIA-Lorraine)
Session III: January 17 - Chaired by Willliam Pugh (University
of Maryland)
Portable, Unobtrusive Garbage Collection for Multiprocessor Systems
Damien Doligez (Ecole
Normale Superieure)
Georges Gonthier (INRIA
Rocquencourt)
Higher-Order Concurrent Programs with Finite Communication Topology
Hanne Riis Nielson, Flemming
Nielson (Aarhus University)
Proving Concurrent Constraint Programs Correct
F. S. De Boer (Free University,
Amsterdam)
M. Gabrielli, Elena Marchiori
(CWI, Amsterdam)
C. Palamidessi (DISI,
Genova)
Session IV: January 17 - Chaired by John Launchbury
(Glasgow University)
Manifest Types, Modules, and Separate Compilation
Xavier Leroy (Stanford
University)
A Type- Theoretic Approach to Higher-Order Modules with Sharing
Robert Harper, Mark Lillibridge
(Carnegie Mellon University)
A Type System for Prototyping Languages
Dinesh Katiyar, David
Luckham, John Mitchell (Stanford University)
Session V: January 12 - Chaired by Luca Cardelli (DEC Systems
Research Center)
Decidable Bounded Quantification
Giuseppe Castagna (LIENS(CNRS)-DMI)
Benjamin C. Pierce (University
of Edinburgh)
Soft Typing with Conditional Types
Alexander Aiken, Edward
L. Wimmers (IBM Almaden Research Center)
T. K. Lakshman (University
of Illinois at Urbana-Champaign)
Automated Synthesis of Interface Adapters for Reusable Classes
Satish Thatte (Clarkson
University)
Session VI: January 12 - Chaired by Hans-J. Boehm (Xerox PARC)
Implementation of the Typed Call-by-Value A-Calculus using a Stack of Regions
Mads Tofte (University
of Copenhagen)
Jean-Pierre Talpin (European
Computer Industry Research Center)
Deriving Algorithms From Type Inference Systems: Application to Strictness
Analysis
Chris Hankin (Imperial
College)
Daniel Le Metayer (INRIA/IRISA,
Rennes)
Formally Optimal Boxing
Fritz Henglein, Jesper
Jorgensen (University of Copenhagen)
Session VII: January 12 - Chaired by Dale Miller (University
of Pennsylvania)
Combinations of Abstract Domains for Logic Programming
Agostino Cortesi (Brown
University)
Baudoin Le Charlier (University
of Namur)
Pascal Van Hentenryck
(Brown University)
Analyzing Logic Programs with Dynamic Scheduling
Kim Marriott (Monash
University)
Maria Jose Garcia De
La Banda, Manuel Hermenegildo (UPM, Madrid)
Higher-Order Equational Logic Programming
Zhenyu Qian (Universitat
Bremen)
A Needed Narrowing Strategy
Seroio Antoy (Portland
State University)
Rachid Echaeed (IMAG-LGI,
CNRS, Grenoble)
Michael Hanus (MPI Informatik,
Saarbrucken)
Session VIII: January 12 - Chaired by Kenny Zadeck (IBM T.J.Watson
Research)
Detecting Pipeline Structural Hazards Quickly
Todd A. Proebsting (University
of Arizona)
Christopher W. Fraser
(AT&T Bell Laboratories)
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible
Flowgraph
G. Ramalingam (IBM T.J.
Watson Research)
Thomas Reps (University
of Wisconson-Madison)
Value Dependence Graphs: Representation without Taxation
Daniel Weise, Roger F.
Crew, Michael Ernst, Bjarne Steensgaard (Microsoft Research)
Lazy Array Data-Flow Dependence Analysis
Vadim Maslov (University
of Maryland)
Session IX: January 12 - Chaired by Gerard Berry (Ecole des
Mines, Sophia-Antipolis)
An Operational Framework for Value-Passing Processes
Rance Cleaveland, Daniel
Yankelevich (North Carolina State University)
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms
Bard Bloom (Cornell University)
Combinatory Representation of Mobile Processes
Kohei Honda, Nobuko Yoshida
(Keio University)
Session 9: January 12 - Chaired by Rodney Farrow (Declarative
Systems)
Multi-Pass Execution of Functional Logic Programs
Jukka Paakki (University
of Jyvaskyla)
Composing Tree Attributions
John Boyland, Susan Graham
(University of California, Berkeley)
A Staging Calculus and its Application to the Verification of Translators
Robert Muller (Apple
Computer)
Session X: January 13 - Chaired by Bob Ballance (Object Science
Corp. and University of New Mexico)
Reducing Indirect Function call Overhead in C++ Programs
Brad Calder, Dirk Grunwald
(University of Colorado at Boulder)
Call Forwarding: A Simple Inter-procedural Optimization Technique for Dynamically
Typed Languages
Koen De Bosschere (Universiteit
Gent)
Saumya K. Debray, David
Gudeman, Sampath Kannan (The University of Arizona)
The Revival Transformation
Lawrence Feigen, David
Klappholz, Robert Casazza, Xing Xue (Stevens Institute of Technology)
Session XI: January 13 - Chaired by Carolyn Talcott (Stanford
University)
Selective and Lightweight Closure Conversion
Mitchell Wand, Paul Steckler
(Northeastern University)
Representing Monads
Andrzej Filinski (Carnegie
Mellon University)
A Generic Account of Continuation-Passing Styles
John Hatcliff (Kansas
State University)
Olivier Danvy (Aarhus
University)
Budding Interpreters by Composing Monads
Guy L. Steele, Jr. (Thinking
Machines Corporation)
-top-