18. POPL 1991: Orlando, Florida

• R. S. Sundaresh, Paul Hudak:
  Incremental Compilation via Partial Evaluation. 1-13
  
• Charles Consel, Olivier Danvy:
  Static and Dynamic Semantics Processing. 14-24
  
• Martin Odersky:
  How to Make Destructive Updates Less Destructive. 25-36
  
• R. C. Sekar, Prateek Mishra, I. V. Ramakrishnan:
  On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. 37-48
  
• Samson Abramsky, Thomas P. Jensen:
  A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. 49-54
  
• Jong-Deok Choi, Ron Cytron, Jeanne Ferrante:
  Automatic Construction of Sparse Data Flow Evaluation Graphs. 55-66
  
• Keshav Pingali, Micah Beck, Richard Johnson, Mayan Moudgill, Paul Stodghill:
  Dependence Flow Graphs: An Algebraic Approach to Program Dependencies. 67-78
  
• Shlomit S. Pinter, Ron Y. Pinter:
  Program Optimization and Parallelization Using Idioms. 79-92
  
• William Landi, Barbara G. Ryder:
  Pointer-Induced Aliasing: A Problem Classification. 93-103
  
• Roberto M. Amadio, Luca Cardelli:
  Subtyping Recursive Types. 104-118
  
• Fritz Henglein, Harry G. Mairson:
  The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. 119-130
  
• Robert Harper, Benjamin C. Pierce:
  A Record Calculus Based on Symmetric Concatenation. 131-142
  
• Jiazhen Cai, Robert Paige:
  ``Look Ma, No Hashing, And No Arrays Neither''. 143-154
  
• William D. Clinger, Jonathan Rees:
  Macros That Work. 155-162
  
• Bruce F. Duba, Robert Harper, David B. MacQueen:
  Typing First-Class Continuations in ML. 163-173
  
• Christian Queinnec, Bernard P. Serpette:
  A Dynamic Extent Control Operator for Partial Continuations. 174-184
  
• Dorai Sitaram, Matthias Felleisen:
  Modeling Continuations without Continuations. 185-196
  
• Steven Lucco, Oliver Sharp:
  Parallel Programming With Coordination Structures. 197-208
  
• Yuh-Jzer Joung, Scott A. Smolka:
  Coordinating First-Order Multiparty Interactions. 209-220
  
• Alon Kleinman, Yael Moscowitz, Amir Pnueli, Ehud Y. Shapiro:
  Communication with Directed Logic Variables. 221-232
  
• Erik Crank, Matthias Felleisen:
  Parameter-Passing and the Lambda Calculus. 233-244
  
• Jon G. Riecke:
  Fully Abstract Translations between Functional Languages. 245-254
  
• Luc Maranget:
  Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting Systems. 255-269
  
• John C. Mitchell, Sigurd Meldal, Neel Madhav:
  An Extension of Standard ML Modules with Subtyping and Inheritance. 270-278
  
• Alexander Aiken, Brian R. Murphy:
  Static Type Inference in a Dynamically Typed Language. 279-290
  
• Xavier Leroy, Pierre Weis:
  Polymorphic Type Inference and Assignment. 291-302
  
• Pierre Jouvelot, David K. Gifford:
  Algebraic Reconstruction of Types and Effects. 303-310
  
• Vaughan R. Pratt:
  Modeling Concurrency with Geometry. 311-322
  
• Martín Abadi, Gordon D. Plotkin:
  A Logical View of Composition and Refinement. 323-332
  
• Vijay A. Saraswat, Martin C. Rinard, Prakash Panangaden:
  Semantic Foundations of Concurrent Constraint Programming. 333-352
  
• Thomas A. Henzinger, Zohar Manna, Amir Pnueli:
  Temporal Proof Methodologies for Real-time Systems. 353-366