POPL 1993
43 papers
- A Categorized Bibliography on Incremental Computation
- A Concurrent, Generational Garbage Collector for a Multithreaded Implementation of ML
- A Constructive Logic of Multiple Subtyping
- A Natural Semantics for Lazy Evaluation
- A Novel Framework of Register Allocation for Software Pipelining
- A Sort Inference Algorithm for the Polyadic Pi-Calculus
- Algebraic Reasoning and Completeness in Typed Languages
- An Introduction to Logical Relations and Parametric Polymorphism - Tutorial
- Array Data-Flow Analysis and its Use in Array Privatization
- Automatic Array Alignment in Data-Parallel Programs
- Automatic Generation and Management of Interprocedural Program Analyses
- Call by Name, Assignment, and the Lambda Calculus
- Communicating Reactive Processes
- Complexity of Bidirectional Data Flow Analysis
- Compositional Analysis of Modular Logic Programs
- Computer Architectures and Programming Models for Scalable Parallel Computing
- Constructing Call Multigraphs Using Dependence Graphs
- Differential Logic Programming
- Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects
- Efficient Recursive Subtyping
- Evicted Variables and the Interaction of Global Register Allocation and Symbolic Debugging
- Explicit Polymorphism and CPS Conversion
- Extending Record Typing to Type Parametric Modules with Sharing
- Formal Parametric Polymorphism
- Graph Types
- Imperative Functional Programming
- Incremental Program Testing Using Program Dependence Graphs
- Layer Sharing: An Improved Structure-Sharing Framework
- Object-Oriented Programming without Recursive Types
- On the Orthogonality of Assignments and Procedures in Algol
- Polymorphism by Name for References and Continuations
- Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes
- Relational Parametricity and Local Variables
- Safe Type Checking in a Statically-Typed Object-Oriented Programming Language
- Semantics for Communication Primitives in an Polymorphic Language
- Separating Stages in the Continuation-Passing Style Transformation
- Smartest Recompilation
- Specifying the Correctness of Binding-Time Analysis
- Static Single Assignment for Explicitely Parallel Programs
- Stratified Functional Programs and Computational Complexity
- The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering
- Tutorial Notes on Partial Evaluation
- Type Checking Type Classes