TOPLAS 1989
26 papers
- A Denotational Semantics for Prolog
- A Generalization of Dijkstra's Calculus
- A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for Lisp
- Code Generation Using Tree Matching and Dynamic Programming
- Concurrency in Heavily Loaded Neighborhood-Constrained Systems
- Designing Families of Data Types Using Exemplars
- Distributed FIFO Allocation of Identical Resources Using Small Shared Space
- ECCS and LIPS: Two Languages for OSI Systems Specification and Verification
- Efficient High-Level Iteration with Accumulators
- Efficient Implementation of Lattice Operations
- Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation
- Functional Computations in Logic Programs
- I-Structures: Data Structures for Parallel Computing
- Incremental Dynamic Semantics for Language-Based Programming Environments
- Integrating Noninterfering Versions of Programs
- Local Atomicity Properties: Modular Concurrency Control for Abstract Data Types
- On Lamport's Interprocessor Communication Model
- On the Productivity of Recursive List Definitions
- Row Replacement Algorithms for Screen Editors
- Scheduling Expressions on a Pipelined Processor with a Maximal Delay of One Cycle
- Some Comments on ''A Solution to a Problem with Morel and Renvoise's 'Global Optimization by Suppression of Partial Redundancies'
- Static Inference of Modes and Data Dependencies in Logic Programs
- Synchronization of Asynchronous Processes in CSP
- Type Representation of Objects by Functions
- Uniform Self-Stabilizing Rings
- Verifying Temporal Properties without Temporal Logic