POPL 1978
27 papers
- A Forward Move Algorithm for LR Error Recovery
- A General Scheme for the Automatic Inference of Variable Types
- A Metalanguage for Interactive Proof in LCF
- A New Method for Compiler Code Generation
- A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp
- A Portable Compiler: Theory and Practice
- A Simplifier Based on Efficient Decision Algorithms
- A Straightforward Denotational Semantics for Non-Determinant Data Flow Programs
- Almost Control-Free (Indeterministic) Parallel Computation on Permit Schemes
- Automatic Discovery of Linear Restraints Among Variables of a Program
- Automating Proofs of the Absence of Common Runtime Errors
- Clauses: Scope Structures and Defined Functions in Lucid
- Compilation and Delayed Evaluation in APL
- Complexity of Expressions Allowing Concurrency
- Data Types as Values: Polymorphism, Type-Checking, Encapsulation
- Efficient Computation of Expressions with Common Subexpressions
- Local Constraints in the Syntax and Semantics of Programming Languages
- Monoids for Rapid Data Flow Analysis
- Nondeterminism in Logics of Programs
- Off-Line and On-Line Algorithms for Deducing Equalities
- Reasoning about Recursively Defined Data Structures
- Symbolic Programming Analysis in Almost Linear Time
- Syntactic Control of Interference
- The Smalltalk-76 Programming System
- Type Definitions with Parameters
- Unrestricted Procedure Calls in Hoare's Logic
- Verification and Design Aspects of "True" Concurrency