Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.Read more
- Covers both operational and denotational semantics
- Comprehensive and balanced view
- Class tested in graduate classes
Reviews & endorsements
"...the book is well written and will be clear to readers with sufficient mathematical maturity." Computing ReviewsSee more reviews
"...fills a gap in the literature, giving us a wide perspective of the development of domain theory...self-contained and amazingly clear in many respects...an excellent survey, and recommended reading, for those who have been exposed to the subject and seek a good technical introduction to advanced topics..." Mathematical Reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: May 2008
- format: Paperback
- isbn: 9780521062923
- length: 504 pages
- dimensions: 229 x 152 x 29 mm
- weight: 0.73kg
- contains: 85 b/w illus.
- availability: Available
Table of Contents
1. Continuity and computability
2. Syntactic theory of λ-calculus
3. D∞ models and intersection types
4. Interpretation of λ-calculi in CCC's
5. CCC's of algebraic dcpo's
6. The language PCF
7. Domain equations
8. Values and computations
10. Stone duality
11. Dependent and second order types
13. Towards linear logic
15. Domains and realizability
16. Functions and processes
Appendix 1: summary of recursion theory
Appendix 2: summary of category theory
References and bibliography
Welcome to the resources site
Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email firstname.lastname@example.org
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×