MFPS 1991: Pittsburgh, PA, USA

• QingMing Ma, John C. Reynolds:
  Types, Abstractions, and Parametric Polymorphism, Part 2. 1-40
  
• John Gateley, Bruce F. Duba:
  Call-by-Value Combinatory Logic and the Lambda-Value Calculus. 41-53
  
• Scott F. Smith:
  From Operational to Denotational Semantics. 54-76
  
• Michael W. Mislove, Frank J. Oles:
  A Simple Language Supporting Angelic Nondeterminism and Parallel Composition. 77-101
  
• Kim B. Bruce:
  The Equivalence of Two Semantic Definitions for Inheritance in Object-Oriented Languages. 102-124
  
• Neal Nelson:
  Primitive Recursive Functionals with Dependent Types. 125-143
  
• Gary T. Leavens, Don Pigozzi:
  Typed Homomorphic Relations Extended with Sybtypes. 144-167
  
• Jon Barwise:
  Information Links in Domain Theory. 168-192
  
• Jan J. M. M. Rutten:
  Nonwellfounded Sets and Programming Language Semantics. 193-206
  
• John W. Gray:
  Simultaneous Substitution in the Typed Lambda Calculus. 207-220
  
• Michael Barr:
  HSP Type Theorems in the Category of Posets. 221-234
  
• Achim Jung, Leonid Libkin, Hermann Puhlmann:
  Decomposition of Domains. 235-258
  
• Michael Huth:
  Cartesian Closed Categories of Domains and the Space Proj(D). 259-271
  
• Reinhold Heckmann:
  An Upper Power Domain Construction in Terms of Strongly Compact Sets. 272-293
  
• Mitchell Wand:
  Correctness of Procedure Representations in Higher-Order Assembly Language. 294-311
  
• Nicolas Mercouroff:
  An Algorithm for Analyzing Communicating Processes. 312-325
  
• Stephen D. Brookes, Shai Geva:
  Continuous Functions and Parallel Algorithms on Concrete Data Structures. 326-349
  
• Bard Bloom, Marta Z. Kwiatkowska:
  Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. 350-375
  
• Luca Aceto:
  On Relating Concurency and Nondeterminism. 376-402
  
• Stefano Kasangian, Anna Labella:
  On Continuous Time Agents. 403-425
  
• Guo-Qiang Zhang:
  A Monoidal Closed Category of Event Structures. 426-435
  
• Giuseppe Rosolini:
  An Exper Model for Quest. 436-445
  
• Ernest G. Manes:
  Equations for if-then-else. 446-456
  
• Stephen L. Bloom, Zoltán Ésik:
  Program Correctness and Matricial Iteration Theories. 457-476
  
• Nils Klarlund:
  Liminf Progress Measures. 477-491
  
• Austin Melton, Bernd S. W. Schröder, George E. Strecker:
  Connections. 492-506