default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th POPL 1988: San Diego, California, USA
- Jeanne Ferrante, Peter Mager:
Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, California, USA, January 10-13, 1988. ACM Press 1988, ISBN 0-89791-252-7 - Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck:
Detecting Equality of Variables in Programs. 1-11 - Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck:
Global Value Numbers and Redundant Computations. 12-27 - John C. Mitchell, Robert Harper:
The Essence of ML. 28-46 - John M. Lucassen, David K. Gifford:
Polymorphic Effect Systems. 47-57 - A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
A Proper Extension of ML with an Effective Type-Assignment. 58-69 - Luca Cardelli
:
Structural Subtyping and the Notion of Power Type. 70-79 - Samuel N. Kamin:
Inheritance in Smalltalk-80: A Denotational Definition. 80-87 - Ryan Stansifer:
Type Inference with Subtypes. 88-97 - Hanne Riis Nielson, Flemming Nielson:
Automatic Binding Time Analysis for a Typed Lambda-Calculus. 98-106 - Paul Hudak, Jonathan Young:
A Collecting Interpretation of Expressions (Without Powerdomains). 107-118 - Philip Wadler:
Strictness Analysis Aids Time Analysis. 119-132 - Susan Horwitz, Jan F. Prins, Thomas W. Reps:
Integrating Non-Interfering Versions of Programs. 133-145 - Susan Horwitz, Jan F. Prins, Thomas W. Reps:
On the Adequacy of Program Dependence Graphs for Representing Programs. 146-157 - Gregory F. Johnson, Dominic Duggan:
Stores and Partial Continuations as First-Class Objects in a Language and its Environment. 158-168 - John H. Williams, Edward L. Wimmers:
Sacrificing Simplicity for Convenience: Where Do You Draw the Line? 169-179 - Matthias Felleisen:
The Theory and Practice of First-Class Prompts. 180-190 - Albert R. Meyer, Kurt Sieber:
Towards Fully Abstract Semantics for Local Variables. 191-203 - Margaret Montenyohl, Mitchell Wand:
Correct Flow Analysis in Continuation Semantics. 204-218 - Stephen J. Garland, John V. Guttag:
Inductive Methods for Reasoning about Abstract Data Types. 219-228 - Bard Bloom, Sorin Istrail, Albert R. Meyer:
Bisimulation Can't Be Traced. 229-239 - Luc Bougé, Nissim Francez:
A Compositional Approach to Superimposition. 240-249 - Moshe Y. Vardi:
A Temporal Fixpoint Calculus. 250-259 - Saumya K. Debray:
Efficient Dataflow Analysis of Logic Programs. 260-273 - Martin D. Carroll, Barbara G. Ryder:
Incremental Data Flow Analysis via Dominator and Attribute Updates. 274-284 - Cristina Ruggieri, Thomas P. Murtagh:
Lifetime Analysis of Dynamically Allocated Objects. 285-293 - Eduardo Pelegrí-Llopart, Susan L. Graham:
Optimal Code Generation for Expression Trees: An Application of BURS Theory. 294-308 - Monica Lam:
Compiler Optimizations for Asynchronous Systolic Array Programs. 309-318 - François Irigoin, Rémi Triolet:
Supernode Partitioning. 319-329
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-03 22:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
