TOPLAS 1985
32 papers
- A Distributed Alternative to Finite-State-Machine Specifications
- A Modular Verifiable Exception-Handling Mechanism
- A New Analysis of LALR Formalisms
- A Note on Cohen's "Eliminating Redundant Recursive Calls"
- A Note on Hennessy's "Symbolic Debugging of Optimized Code"
- Addendum to "The Promotion and Accumulation Strategies in Transformational Programming"
- Affix Grammar Driven Code Generation
- Circal and the Representation of Communication, Concurrency, and Time
- Data Types Are Values
- Dealing with World-Model-Based Programs
- Describing and Analyzing Distributed Software System Designs
- Detecting Global Variables in Denotational Specifications
- Editing by Example
- Efficient Demand-Driven Evaluation - Part 1
- Generalizing Specifications for Uniformly Implemented Loops
- Generative Communication in Linda
- Implementation of Resilient, Atomic Data Types
- Information-Flow and Data-Flow Analysis of while-Programs
- Multilisp: A Language for Concurrent Symbolic Computation
- Noncorrecting Syntax Error Recovery
- On Convergence Toward a Database of Program Transformations
- Optimal Parallel Generation of a Computation Tree Form
- Optimal Prepaging and Font Caching
- Procedures as Persistent Data Objects
- Program Abstraction and Instantiation
- Program Transformations in a Denotational Setting
- Proofs as Programs
- Side Effects and Aliasing Can Have Simple Axiomatic Descriptions
- Symmetric Intertask Communication
- The Denotational Semantics of Dynamic Networks of Processes
- Towards Monolingual Programming Environments
- Virtual Time