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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Review
"...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
"...thoroughly recommended for anyone interested in computability." Steven Vickers, The Computer Journal
Book Description
This book is devoted to providing an accessible, unified and self-contained introduction to domain theory. It can be, and has been, used as an introductory textbook or as a general reference for professionals in computer science and logic.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Some concepts and elementary results from the theory of sets, the theory of ordered sets and category theory will be assumed in the chapters that follow. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
total continuous functionals, first recursion theorem, algebraic epos, quotient numbering, effective functors, approximable mapping, colimiting cone, mediating morphism, partial continuous functionals, second recursion theorem, algebraic cpo, function space construction, compact elements, canonical index, applicative structure, consistent completeness, computable structure, effective numbering, topological base, projection pair, branching lemma, total recursive function, ultrametric space, least fixed point, combinatory algebra Key Phrases - Capitalized Phrases (CAPs): (learn more)
Definition Let, Proposition Let, Corollary Let, Example Let, Proposition Suppose, Theorem Every New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Some concepts and elementary results from the theory of sets, the theory of ordered sets and category theory will be assumed in the chapters that follow. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
total continuous functionals, first recursion theorem, algebraic epos, quotient numbering, effective functors, approximable mapping, colimiting cone, mediating morphism, partial continuous functionals, second recursion theorem, algebraic cpo, function space construction, compact elements, canonical index, applicative structure, consistent completeness, computable structure, effective numbering, topological base, projection pair, branching lemma, total recursive function, ultrametric space, least fixed point, combinatory algebra Key Phrases - Capitalized Phrases (CAPs): (learn more)
Definition Let, Proposition Let, Corollary Let, Example Let, Proposition Suppose, Theorem Every New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Citations (learn more)
This book cites 35
books:
See all 35 books this book cites
22
books
cite this book:
See all 22 books citing this book
- General Topology (Graduate Texts in Mathematics) by John L. Kelley on page 114, and Back Matter
- Introduction to Metamathematics (Bibliotheca Mathematica) by S.C. Kleene in Back Matter
- Belief Revision (Cambridge Tracts in Theoretical Computer Science) by Peter Gärdenfors in Front Matter
- Algebraic Specification of Communication Protocols (Cambridge Tracts in Theoretical Computer Science) by S. Mauw in Front Matter
- Programming Languages by Allen Tucker in Back Matter
See all 35 books this book cites
- Handbook of Computability Theory, Volume 140 (Studies in Logic and the Foundations of Mathematics) by E.R. Griffor on page 445, and page 585
- The Optimal Implementation of Functional Programming Languages (Cambridge Tracts in Theoretical Computer Science) by Andrea Asperti in Front Matter
- Concurrency Verification: Introduction to Compositional and Non-compositional Methods (Cambridge Tracts in Theoretical Computer Science) by Willem-Paul de Roever in Front Matter
- Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science) by Roberto M. Amadio in Front Matter
- Basic Simple Type Theory (Cambridge Tracts in Theoretical Computer Science) by J. Roger Hindley in Front Matter
See all 22 books citing this book
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Software Engineering
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
