14. POPL 1987: Munich, Germany

• Zohar Manna, Amir Pnueli:
  Specification and Verification of Concurrent Programs By Forall-Automata. 1-12
  
• Maurice Herlihy, Jeannette M. Wing:
  Axioms for Concurrent Objects. 13-26
  
• Jennifer Widom, David Gries, Fred B. Schneider:
  Completeness and Incompleteness of Trace-Based Network Proof Systems. 27-38
  
• Pierre Jouvelot:
  Semantic Parallelization: A Practical Exercise in Abstract Interpretation. 39-48
  
• Vijay A. Saraswat:
  The Concurrent Logic Programming Language CP: Definition and Operational Semantics. 49-62
  
• Randy Allen, David Callahan, Ken Kennedy:
  Automatic Decomposition of Scientific Programs for Parallel Execution. 63-76
  
• Eugene E. Kohlbecker, Mitchell Wand:
  Macro-by-Example: Deriving Syntactic Transformations from their Specifications. 77-84
  
• Jiazhen Cai, Robert Paige:
  Binding Performance at Language Design Time. 85-97
  
• David Gelernter, Suresh Jagannathan, Thomas London:
  Environments as First Class Objects. 98-110
  
• Joxan Jaffar, Jean-Louis Lassez:
  Constraint Logic Programming. 111-119
  
• Flemming Nielson:
  Strictness Analysis and Denotational Abstract Interpretation. 120-131
  
• Cordelia V. Hall, David S. Wise:
  Compiling Strictness into Streams. 132-143
  
• Tsung-Min Kuo, Prateek Mishra:
  On Strictness and its Analysis. 144-155
  
• M. Drew Moshier, William C. Rounds:
  A Logic for Partially Specified Data Structures. 156-167
  
• David R. Chase:
  An Improvement to Bottom-up Tree Pattern Matching. 168-177
  
• Paul Caspi, Daniel Pilaud, Nicolas Halbwachs, John Plaice:
  Lustre: A Declarative Language for Programming Synchronous Systems. 178-188
  
• Krzysztof R. Apt, Nissim Francez, Shmuel Katz:
  Appraising Fairness in Languages for Distributed Programming. 189-198
  
• Eugene W. Stark:
  Concurrent Transition System Semantics of Process Networks. 199-210
  
• Frank J. Oles:
  Semantics for Concurrency without Powerdomains. 211-222
  
• Cornelis Huizing, Rob Gerth, Willem P. de Roever:
  Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language. 223-237
  
• Val Tannen, Albert R. Meyer:
  Computable Values Can Be Classical. 238-245
  
• Daniel Leivant, Tim Fernando:
  Skinny and Fleshy Failures of Relative Completeness. 246-252
  
• Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman:
  Empty Types in Polymorphic Lambda Calculus. 253-262
  
• David Bernstein, Jeffrey M. Jaffe, Michael Rodeh:
  Scheduling Arithmetic and Load Operations in Parallel with No Spilling. 263-273
  
• Anne Neirynck, Prakash Panangaden, Alan J. Demers:
  Computation of Aliases and Support Sets. 274-283
  
• Peter Lee, Uwe F. Pleban:
  A Realistic Compiler Generator Based on High-Level Semantics. 284-295
  
• David R. Cheriton, Michael E. Wolf:
  Extensions for Multi-Module Records in Conventional Programming Languages. 296-306
  
• Philip Wadler:
  Views: A Way for Pattern Matching to Cohabit with Data Abstraction. 307-313
  
• Matthias Felleisen, Daniel P. Friedman:
  A Calculus for Assignments in Higher-Order Languages. 314-325