Abstract is missing.
- Detecting Equality of Variables in ProgramsBowen Alpern, Mark N. Wegman, F. Kenneth Zadeck. 1-11
- Global Value Numbers and Redundant ComputationsBarry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck. 12-27
- The Essence of MLJohn C. Mitchell, Robert Harper. 28-46
- Polymorphic Effect SystemsJohn M. Lucassen, David K. Gifford. 47-57
- A Proper Extension of ML with an Effective Type-AssignmentA. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. 58-69
- Structural Subtyping and the Notion of Power TypeLuca Cardelli. 70-79
- Inheritance in Smalltalk-80: A Denotational DefinitionSamuel N. Kamin. 80-87
- Automatic Binding Time Analysis for a Typed Lambda-CalculusHanne Riis Nielson, Flemming Nielson. 98-106
- A Collecting Interpretation of Expressions (Without Powerdomains)Paul Hudak, Jonathan Young. 107-118
- Strictness Analysis Aids Time AnalysisPhilip Wadler. 119-132
- Integrating Non-Interfering Versions of ProgramsSusan Horwitz, Jan Prins, Thomas W. Reps. 133-145
- On the Adequacy of Program Dependence Graphs for Representing ProgramsSusan Horwitz, Jan Prins, Thomas W. Reps. 146-157
- Stores and Partial Continuations as First-Class Objects in a Language and its EnvironmentGregory F. Johnson, Dominic Duggan. 158-168
- Sacrificing Simplicity for Convenience: Where Do You Draw the Line?John H. Williams, Edward L. Wimmers. 169-179
- The Theory and Practice of First-Class PromptsMatthias Felleisen. 180-190
- Towards Fully Abstract Semantics for Local VariablesAlbert R. Meyer, Kurt Sieber. 191-203
- Correct Flow Analysis in Continuation SemanticsMargaret Montenyohl, Mitchell Wand. 204-218
- Inductive Methods for Reasoning about Abstract Data TypesStephen J. Garland, John V. Guttag. 219-228
- Bisimulation Can t Be TracedBard Bloom, Sorin Istrail, Albert R. Meyer. 229-239
- A Compositional Approach to SuperimpositionLuc Bougé, Nissim Francez. 240-249
- Efficient Dataflow Analysis of Logic ProgramsSaumya K. Debray. 260-273
- Incremental Data Flow Analysis via Dominator and Attribute UpdatesMartin D. Carroll, Barbara G. Ryder. 274-284
- Lifetime Analysis of Dynamically Allocated ObjectsCristina Ruggieri, Thomas P. Murtagh. 285-293
- Optimal Code Generation for Expression Trees: An Application of BURS TheoryEduardo PelegrĂ-Llopart, Susan L. Graham. 294-308
- Compiler Optimizations for Asynchronous Systolic Array ProgramsMonica S. Lam. 309-318