TOPLAS 1991
25 papers
- A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables
- A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables
- An Ad Hoc Approach to the Implementation of Polymorphism
- An Improved Storage Management Scheme for Block Structured Languages
- Automatic Generation and Use of Abstract Structure Operators
- Automatic Transformation of Series Expressions into Loops
- Collecting Interpretations of Expressions
- Compilation of Functional Languages by Program Transformation
- Constant Propagation with Conditional Branches
- Data Flow Analysis of Communicating Finite State Machines
- Dynamic Typing in a Statically Typed Language
- Efficient Construction of LR(k) States and Tables
- Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
- INC: A Language for Incremental Computations
- Incremental Attribute Evaluation: A Flexible Algorithm for Lazy Update
- Linking Programs Incrementally
- Practical Adaptation of the Global Optimization Algorithm of Morel and Renvoise
- Reply to "Subtypes and Quantification"
- Reply to "Type-Extension Tests Can Be Performed In Constant Time"
- Subtypes and Quantification
- Table Compression for Tree Automata
- Techniques for Debugging Parallel Programs with Flowback Analysis
- The Concurrent Language, Shared Prolog
- Type-Extension Type Tests Can Be Performed In Constant Time
- Wait-Free Synchronization