MFPS 1989: Tulane University, New Orleans, Louisiana, USA
Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings. Springer 1990 Lecture Notes in Computer Science ISBN 3-540-97375-3- Samson Abramsky: A Generalized Kahn Principle for Abstract Asynchronous Networks. 1-21
- 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
- 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
- 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
- Prakash Panangaden, James R. Russell: A Category-theoretic Semantics for Unbounded Indeterminacy. 319-332
- 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
- John W. Gray: Initial Algebra Semantics for Lambda Calculi. 418-439
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team