POPL 1991
31 papers
- "Look Ma, No Hashing, And No Arrays Neither"
- A Dynamic Extent Control Operator for Partial Continuations
- A Logical View of Composition and Refinement
- A Record Calculus Based on Symmetric Concatenation
- A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions
- Algebraic Reconstruction of Types and Effects
- An Extension of Standard ML Modules with Subtyping and Inheritance
- Automatic Construction of Sparse Data Flow Evaluation Graphs
- Communication with Directed Logic Variables
- Coordinating First-Order Multiparty Interactions
- Dependence Flow Graphs: An Algebraic Approach to Program Dependencies
- Fully Abstract Translations between Functional Languages
- How to Make Destructive Updates Less Destructive
- Incremental Compilation via Partial Evaluation
- Macros That Work
- Modeling Concurrency with Geometry
- Modeling Continuations without Continuations
- On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation
- Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting Systems
- Parallel Programming With Coordination Structures
- Parameter-Passing and the Lambda Calculus
- Pointer-Induced Aliasing: A Problem Classification
- Polymorphic Type Inference and Assignment
- Program Optimization and Parallelization Using Idioms
- Semantic Foundations of Concurrent Constraint Programming
- Static Type Inference in a Dynamically Typed Language
- Static and Dynamic Semantics Processing
- Subtyping Recursive Types
- Temporal Proof Methodologies for Real-time Systems
- The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
- Typing First-Class Continuations in ML