3. POPL 1976: Atlanta, Georgia

• Benton L. Leong, Detlef Wotschke:
  The Influence of Productions on Derivations and Parsing. 1-11
  
• Harry B. Hunt III:
  A Complexity Theory of Grammar Problems. 12-18
  
• Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
  Code Generation for Expressions with Common Subexpressions. 19-31
  
• Ken Kennedy, Scott K. Warren:
  Automatic Generation of Efficient Evaluators for Attribute Grammars. 32-49
  
• Gregory R. Ruth:
  Automatic Design of Data Processing Systems. 50-57
  
• James R. Low, Paul Rovner:
  Techniques for the Automatic Selection of Data Structures. 58-67
  
• Phillip D. Summers:
  A Methodology for Lisp Program Construction from Examples. 68-76
  
• Neil D. Jones, Steven S. Muchnick:
  Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. 77-94
  
• Peter Henderson, James H. Morris Jr.:
  A Lazy Evaluator. 95-103
  
• Amelia C. Fong, Jeffrey D. Ullman:
  Induction Variables in Very High Level Languages. 104-112
  
• Brenda S. Baker:
  An Algorithm for Structuring Programs. 113-126
  
• Wilf R. LaLonde:
  On Directly Constructing LR(k) Parsers Without Chain Reductions. 127-133
  
• Reinhold Franck:
  PLAN2D - Syntactic Analysis of Precedence Graph Grammars. 134-139
  
• David B. Loveman:
  Program Improvement by Source to Source Transformation. 140-152
  
• Ben Wegbreit:
  Goal-Directed Program Transformation. 153-170
  
• Robert S. Boyer, J. Strother Moore, Robert E. Shostak:
  Primitive Recursive Program Transformations. 171-174
  
• Paul R. Kosinski:
  Mathematical Semantics and Data Flow Programming. 175-184
  
• Dianne E. Britton, Frederick C. Druseikis, Ralph E. Griswold, David R. Hanson, Richard A. Holmes:
  Procedure Referencing Environments in SL5. 185-191
  
• Patricia P. Griffiths, Charles J. Prenner:
  Verifying Formal Specifications of Synchronous Processes. 192-208
  
• Matthew M. Geller:
  Test Data as an Aid in Proving Program Correctness. 209-218