Mathematical Theory of Domains
Domain theory is the mathematical framework that is used to model the semantics of computer programs and the theory of computation. This is the first book on the subject that attempts to provide a rigorous introduction to the topic in a manner accessible to computer scientists by motivating the mathematics with computer science examples.
- First elementary, self-contained but rigorous treatment
- Class-tested at several universities
- Can be used as text or reference
Reviews & endorsements
"...a valuable introductory book which will be useful as a textbook for students in computer science or logic, or as a general reference." Alessandro Berarducci, Mathematical Reviews
"...thoroughly recommended for anyone interested in computability." Steven Vickers, The Computer Journal
Product details
June 2008Paperback
9780521064798
364 pages
244 × 170 × 19 mm
0.58kg
150 exercises
Available
Table of Contents
- Preliminaries
- Part I. Basic Theory:
- 1. Fixed points
- 2. Complete partial orders
- 3. Domains
- 4. Domain equations
- 5. Topology
- 6. Representation theory
- 7. A universal domain
- Part II. Special Topics:
- 8. Representability in domains
- 9. Basic recursion theory
- 10. Effective domains
- 11. Power domains
- 12. Domains as models of formal theories
- References
- Index of symbols
- Index.