POPL 1988
28 papers
- A Collecting Interpretation of Expressions (Without Powerdomains)
- A Compositional Approach to Superimposition
- A Proper Extension of ML with an Effective Type-Assignment
- A Temporal Fixpoint Calculus
- Automatic Binding Time Analysis for a Typed Lambda-Calculus
- Bisimulation Can't Be Traced
- Compiler Optimizations for Asynchronous Systolic Array Programs
- Correct Flow Analysis in Continuation Semantics
- Detecting Equality of Variables in Programs
- Efficient Dataflow Analysis of Logic Programs
- Global Value Numbers and Redundant Computations
- Incremental Data Flow Analysis via Dominator and Attribute Updates
- Inductive Methods for Reasoning about Abstract Data Types
- Inheritance in Smalltalk-80: A Denotational Definition
- Integrating Non-Interfering Versions of Programs
- Lifetime Analysis of Dynamically Allocated Objects
- On the Adequacy of Program Dependence Graphs for Representing Programs
- Optimal Code Generation for Expression Trees: An Application of BURS Theory
- Polymorphic Effect Systems
- Sacrificing Simplicity for Convenience: Where Do You Draw the Line?
- Stores and Partial Continuations as First-Class Objects in a Language and its Environment
- Strictness Analysis Aids Time Analysis
- Structural Subtyping and the Notion of Power Type
- Supernode Partitioning
- The Essence of ML
- The Theory and Practice of First-Class Prompts
- Towards Fully Abstract Semantics for Local Variables
- Type Inference with Subtypes