Fr. 69.00

Mathematical Foundation of Programming Semantics - International Conference, Manhattan, Kansas, USA, April 11-12, 1985. Proceedings

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










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.

List of contents

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.

Product details

Assisted by Austi Melton (Editor), Austin Melton (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 27.02.2004
 
EAN 9783540168164
ISBN 978-3-540-16816-4
No. of pages 400
Weight 658 g
Illustrations VIII, 400 p.
Series Lecture Notes in Computer Science
Lecture Notes in Computer Science
Subject Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.