5. POPL 1978: Tucson, Arizona, USA

• Leonidas J. Guibas, Douglas K. Wyatt:
  Compilation and Delayed Evaluation in APL. 1-8
  
• Daniel Ingalls:
  The Smalltalk-76 Programming System. 9-16
  
• Edward A. Ashcroft, William W. Wadge:
  Clauses: Scope Structures and Defined Functions in Lucid. 17-22
  
• Alan J. Demers, James E. Donahue, Glenn Skinner:
  Data Types as Values: Polymorphism, Type-Checking, Encapsulation. 23-30
  
• Marvin H. Solomon:
  Type Definitions with Parameters. 31-38
  
• John C. Reynolds:
  Syntactic Control of Interference. 39-46
  
• Barry K. Rosen:
  Monoids for Rapid Data Flow Analysis. 47-59
  
• Marc A. Kaplan, Jeffrey D. Ullman:
  A General Scheme for the Automatic Inference of Variable Types. 60-75
  
• John H. Reif:
  Symbolic Programming Analysis in Almost Linear Time. 76-83
  
• Patrick Cousot, Nicolas Halbwachs:
  Automatic Discovery of Linear Restraints Among Variables of a Program. 84-96
  
• Stephen C. Johnson:
  A Portable Compiler: Theory and Practice. 97-104
  
• Steven M. German:
  Automating Proofs of the Absence of Common Runtime Errors. 105-118
  
• Michael J. C. Gordon, Robin Milner, L. Morris, Malcolm C. Newey, Christopher P. Wadsworth:
  A Metalanguage for Interactive Proof in LCF. 119-130
  
• Robert Cartwright, Derek C. Oppen:
  Unrestricted Procedure Calls in Hoare's Logic. 131-140
  
• Charles G. Nelson, Derek C. Oppen:
  A Simplifier Based on Efficient Decision Algorithms. 141-150
  
• Derek C. Oppen:
  Reasoning about Recursively Defined Data Structures. 151-157
  
• Peter J. Downey, Hanan Samet, Ravi Sethi:
  Off-Line and On-Line Algorithms for Deducing Equalities. 158-170
  
• David W. Mizell:
  Verification and Design Aspects of ``True'' Concurrency. 171-175
  
• Karel Culík:
  Almost Control-Free (Indeterministic) Parallel Computation on Permit Schemes. 176-184
  
• William F. Ogden, William E. Riddle, William C. Rounds:
  Complexity of Expressions Allowing Concurrency. 185-194
  
• Anders Haraldsson:
  A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp. 195-202
  
• David Harel, Vaughan R. Pratt:
  Nondeterminism in Logics of Programs. 203-213
  
• Paul R. Kosinki:
  A Straightforward Denotational Semantics for Non-Determinant Data Flow Programs. 214-221
  
• Bhaskaram Prabhala, Ravi Sethi:
  Efficient Computation of Expressions with Common Subexpressions. 222-230
  
• R. Steven Glanville, Susan L. Graham:
  A New Method for Compiler Code Generation. 231-240
  
• Thomas J. Pennello, Frank DeRemer:
  A Forward Move Algorithm for LR Error Recovery. 241-254
  
• Aravind K. Joshi, Leon S. Levy, Kang Yueh:
  Local Constraints in the Syntax and Semantics of Programming Languages. 255-264
  

Last update Thu May 23 17:50:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page