POPL 1976
20 papers
- A Complexity Theory of Grammar Problems
- A Lazy Evaluator
- A Methodology for Lisp Program Construction from Examples
- An Algorithm for Structuring Programs
- Automatic Design of Data Processing Systems
- Automatic Generation of Efficient Evaluators for Attribute Grammars
- Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language
- Code Generation for Expressions with Common Subexpressions
- Goal-Directed Program Transformation
- Induction Variables in Very High Level Languages
- Mathematical Semantics and Data Flow Programming
- On Directly Constructing LR(k) Parsers Without Chain Reductions
- PLAN2D - Syntactic Analysis of Precedence Graph Grammars
- Primitive Recursive Program Transformations
- Procedure Referencing Environments in SL5
- Program Improvement by Source to Source Transformation
- Techniques for the Automatic Selection of Data Structures
- Test Data as an Aid in Proving Program Correctness
- The Influence of Productions on Derivations and Parsing
- Verifying Formal Specifications of Synchronous Processes