Mathematical Foundation of Programming Semantics: International Conference, Manhattan, Kansas, April 11-12, 1985. Proceedings: Lecture Notes in Computer Science, cartea 239

Standard, storeless semantics for ALGOL-style block structure and call-by-name.- Cartesian closed categories, quasitopoi and topological universes.- Concrete categories and injectivity.- Fixed points in process algebras with internal actions.- A fully abstract semantics and a proof system for an algol-like language with sharing.- Comparing categories of domains.- Galois connections.- Retracts of SFP objects.- Continuous categories.- Free constructions of powerdomains.- Additive domains.- A topological framework for cpos lacking bottom elements.- Detecting local finite breadth in continuous lattices and semilattices.- On the variety concept for ?-continuous algebras. Application of a general approach.- On denotational semantics of data bases.- Postconditional semantics of data base queries.- What is a model? A consumer's perspective on semantic theory.- Modal theory, partial orders, and digital geometry.- An FP domain with infinite objects.- Union complete countable subset systems.- On the syntax and semantics of concurrent computing.