POPL 1985
30 papers
- A Greedy Approach to Incremental Code Generation
- A Meta-Language and System for Nonlocal Incremental Attribute Evaluation in Language-Based Editors
- A Model and Temporal Proof System for Networks of Processes
- Abstract Types Have Existential Type
- Analyzing Aliases of Reference Formal Parameters
- Checking That Finite State Concurrent Programs Satisfy Their Linear Specification
- Closurize and Concentrate
- Compiling Path Expressions into VLSI Circuits
- Constant Propagation with Conditional Branches
- Constraining Control
- Constraints: A Uniform Approach to Aliasing and Typing
- Declaration-Free Type Checking
- Denotational Semantics and Rewrite Rules for FP
- Efficient Tree Pattern Matching: An Aid to Code Generation
- Embedding Type Structure in Semantics
- Functional Programming and the Logical Variable
- High-Level Language Facilities for Low-Level Services
- Incremental Compilation of Locally Optimized Code
- Logical and Mathematical Reasoning about Imperative Programs
- Matchmaker: An Interface Specification Language for Distributed Processing
- Modalities for Model Checking: Branching Time Strikes Back
- On Linearizing Parallel Code
- Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses
- Principles of OBJ2
- Program Specification and Development in Standard ML
- Semantics-Directed Code Generation
- Smart Recompilation
- The Aggregate Update Problem in Functional Programming Systems
- Types as Intervals
- What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority