19. POPL 1992: Albuquerque, New Mexico

• Philip Wadler:
  The Essence of Functional Programming. 1-14
  
• Georges Gonthier, Martín Abadi, Jean-Jacques Lévy:
  The Geometry of Optimal Lambda Reduction. 15-26
  
• Andrzej Filinski:
  Linear Continuations. 27-38
  
• Bernard Lang, Christian Queinnec, José M. Piquer:
  Garbage Collecting the World. 39-50
  
• Daniel R. Edelson:
  A Mark-and-Sweep Collector for C++. 51-58
  
• Thomas Ball, James R. Larus:
  Optimally Profiling and Tracing Programs. 59-70
  
• Hanne Riis Nielson, Flemming Nielson:
  Bounded Fixed Point Iteration. 71-82
  
• Patrick Cousot, Radhia Cousot:
  Inductive Definitions, Semantics and Abstract Interpretation. 83-94
  
• Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi:
  Modeling Prolog Control. 95-104
  
• Martin C. Rinard, Monica S. Lam:
  Semantic Foundations of Jade. 105-118
  
• Dave Berry, Robin Milner, David N. Turner:
  A Semantics for ML Concurrency Primitives. 119-129
  
• Jyh-Herng Chow, Williams Ludwell Harrison III:
  Compile-Time Analysis of Parallel Programs that Share Memory. 130-141
  
• Yuh-Jzer Joung, Scott A. Smolka:
  A Comprehensive Study of the Complexity of Multiparty Interaction. 142-153
  
• Atsushi Ohori:
  A Compilation Method for ML-Style Polymorphic Record Calculi. 154-165
  
• Didier Rémy:
  Typing Record Concatenation for Free. 166-176
  
• Xavier Leroy:
  Unboxed Objects and Polymorphic Typing. 177-188
  
• Mads Tofte:
  Principal Signatures for Higher-Order Program Modules. 189-199
  
• Roberto Di Cosmo:
  Type Isomorphisms in a Type-Assignment Framework. 200-210
  
• Charles Farnum:
  Pattern-Based Tree Attribution. 211-222
  
• Rodney Farrow, Thomas J. Marlowe, Daniel M. Yellin:
  Composable Attribute Grammars: Support for Modularity in Translator Design and Implementation. 223-234
  
• Joseph Bates, Alon Lavie:
  Recognizing Substrings of LR(k) Languages in Linear Time. 235-245
  
• Rajiv Gupta:
  Generalized Dominators and Post-Dominators. 246-257
  
• Jesper Jørgensen:
  Generating a Compiler for a Lazy Language by Partial Evaluation. 258-268
  
• Vivek Nirkhe, William Pugh:
  Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems. 269-280
  
• QingMing Ma:
  Parametricity as Subtyping. 281-292
  
• Patrick Lincoln, John C. Mitchell:
  Algorithmic Aspects of Type Inference with Subtypes. 293-304
  
• Benjamin C. Pierce:
  Bounded Quantification is Undecidable. 305-315
  
• Kim B. Bruce, John C. Mitchell:
  PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism. 316-327
  
• Robert Cartwright, Matthias Felleisen:
  Observable Sequentiality and Full Abstraction. 328-342
  
• Edmund M. Clarke, Orna Grumberg, David E. Long:
  Model Checking and Abstraction. 342-354
  
• Radha Jagadeesan, Keshav Pingali:
  Abstract Semantics for a Higher-Order Functional Language with Logic Variables. 355-366