Mathematical Foundations of Programming Semantics B

22 papers

YearTitle / Authors
1990Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings
Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt
1989A Category-theoretic Semantics for Unbounded Indeterminacy.
Prakash Panangaden, James R. Russell
1989A Generalized Kahn Principle for Abstract Asynchronous Networks.
Samson Abramsky
1989A Hierarchy of Domains for Real-Time Distributed Computing.
George M. Reed
1989Algebraic Types in PER Models.
J. M. E. Hyland, Edmund P. Robinson, Giuseppe Rosolini
1989An Algebraic Formulation for Data Refinement.
A. John Power
1989Categorical Semantics for Programming Languages.
Jifeng He, C. A. R. Hoare
1989Connections between a Concrete and an Abstract Model of Concurrent Systems.
Eugene W. Stark
1989Does "N+1 Times" Prove More Programs Correct Than "N Times"?
Ana Pasztor
1989Equationally Fully Abstract Models of PCF.
Allen Stoughton
1989Factorizing Proofs in Timed CSP.
Jim Davies, Steve A. Schneider
1989Generalization of Final Algebra Semantics by Relativization.
Lawrence S. Moss, Satish R. Thatte
1989Inductively Defined Types in the Calculus of Constructions.
Frank Pfenning, Christine Paulin-Mohring
1989Initial Algebra Semantics for Lambda Calculi.
John W. Gray
1989L-domains and Lossless Powerdomains.
Radha Jagadeesan
1989On Some Semantic Issues in the Reflective Tower.
Karoline Malmkjær
1989Operations on Records.
Luca Cardelli, John C. Mitchell
1989Pseudo-Retract Functors for Local Lattices and Bifinite L-domains.
Elsa L. Gunter
1989Semantic Models for Total Correctness and Fairness.
Michael G. Main, David L. Black
1989Termination, Deadlock and Divergence.
Luca Aceto, Matthew Hennessy
1989The Semantics of Priority and Fairness in occam.
Geoff Barrett
1989Unbounded Nondeterminism in CSP.
A. W. Roscoe, Geoff Barrett