TOPLAS 1982
35 papers
- A Distributed Graph Algorithm: Knot Detection
- A Flexible Notation for Syntactic Definitions
- A Model for Implementing Euclid Modules and Prototypes
- A One-Pass Algorithm for Overload Resolution in Ada
- A Structured APL System
- A System for Assisting Program Transformation
- A Value Transmission Method for Abstract Data Types
- A Weaker Precondition for Loops
- An Efficient Unification Algorithm
- An Introduction to S/SL: Syntax/Semantic Language
- An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem
- Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm
- Compact Storage of Binary Trees
- Data Type Specification: Parameterization and the Power of Specification Techniques
- Deriving Target Code as a Representation of Continuation Semantics
- Efficient Computation of LALR(1) Look-Ahead Sets
- Error Data Values in the Data-Flow Language VAL
- Finite Differencing of Computable Expressions
- Formal Specification of Graphic Data Types
- High-Level Language Implications of the Proposed IEEE Floating-Point Standard
- Inessential Error Entries and Their Use in LR Parser Optimization
- On the Development of the Algebra of Functional Programs
- Programming with Equations
- Proving Liveness Properties of Concurrent Programs
- R/ for Semantics
- Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
- Some Techniques for Recursion Removal from Recursive Programs
- Symbolic Debugging of Optimized Code
- Synchronization in Distributed Programs
- Termination Detection of Diffusing Computations in Communicating Sequential Processes
- The Byzantine Generals Problem
- The Evaluation of Expressions in Icon
- The VAL Language: Description and Analysis
- Transformational Derivation of a Garbage Collection Algorithm
- Using Peephole Optimization on Intermediate Code