POPL 1992
31 papers
- A Compilation Method for ML-Style Polymorphic Record Calculi
- A Comprehensive Study of the Complexity of Multiparty Interaction
- A Mark-and-Sweep Collector for C++
- A Semantics for ML Concurrency Primitives
- Abstract Semantics for a Higher-Order Functional Language with Logic Variables
- Algorithmic Aspects of Type Inference with Subtypes
- Bounded Fixed Point Iteration
- Bounded Quantification is Undecidable
- Compile-Time Analysis of Parallel Programs that Share Memory
- Composable Attribute Grammars: Support for Modularity in Translator Design and Implementation
- Garbage Collecting the World
- Generalized Dominators and Post-Dominators
- Generating a Compiler for a Lazy Language by Partial Evaluation
- Inductive Definitions, Semantics and Abstract Interpretation
- Linear Continuations
- Model Checking and Abstraction
- Modeling Prolog Control
- Observable Sequentiality and Full Abstraction
- Optimally Profiling and Tracing Programs
- PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism
- Parametricity as Subtyping
- Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems
- Pattern-Based Tree Attribution
- Principal Signatures for Higher-Order Program Modules
- Recognizing Substrings of LR(k) Languages in Linear Time
- Semantic Foundations of Jade
- The Essence of Functional Programming
- The Geometry of Optimal Lambda Reduction
- Type Isomorphisms in a Type-Assignment Framework
- Typing Record Concatenation for Free
- Unboxed Objects and Polymorphic Typing