MFPS 1989: Tulane University, New Orleans, Louisiana, USA

• Samson Abramsky:
  A Generalized Kahn Principle for Abstract Asynchronous Networks. 1-21
  
• Luca Cardelli, John C. Mitchell:
  Operations on Records. 22-52
  
• Eugene W. Stark:
  Connections between a Concrete and an Abstract Model of Concurrent Systems. 53-79
  
• George M. Reed:
  A Hierarchy of Domains for Real-Time Distributed Computing. 80-128
  
• Jim Davies, Steve Schneider:
  Factorizing Proofs in Timed CSP. 129-159
  
• A. W. Roscoe, Geoff Barrett:
  Unbounded Nondeterminism in CSP. 160-193
  
• Geoff Barrett:
  The Semantics of Priority and Fairness in occam. 194-208
  
• Frank Pfenning, Christine Paulin-Mohring:
  Inductively Defined Types in the Calculus of Constructions. 209-228
  
• Karoline Malmkjær:
  On Some Semantic Issues in the Reflective Tower. 229-246
  
• Michael G. Main, David L. Black:
  Semantic Models for Total Correctness and Fairness. 247-270
  
• Allen Stoughton:
  Equationally Fully Abstract Models of PCF. 271-283
  
• Lawrence S. Moss, Satish R. Thatte:
  Generalization of Final Algebra Semantics by Relativization. 284-300
  
• Luca Aceto, Matthew Hennessy:
  Termination, Deadlock and Divergence. 301-318
  
• Prakash Panangaden, James R. Russell:
  A Category-theoretic Semantics for Unbounded Indeterminacy. 319-332
  
• J. M. E. Hyland, E. P. Robinson, Giuseppe Rosolini:
  Algebraic Types in PER Models. 333-350
  
• Elsa L. Gunter:
  Pseudo-Retract Functors for Local Lattices and Bifinite L-domains. 351-363
  
• Radha Jagadeesan:
  L-domains and Lossless Powerdomains. 364-372
  
• Ana Pasztor:
  Does "N+1 Times" Prove More Programs Correct Than "N Times"? 373-389
  
• A. John Power:
  An Algebraic Formulation for Data Refinement. 390-401
  
• Jifeng He, C. A. R. Hoare:
  Categorical Semantics for Programming Languages. 402-417
  
• John W. Gray:
  Initial Algebra Semantics for Lambda Calculi. 418-439