- Used Books
- Staff Picks
- Gifts & Gift Cards
- Sell Books
- Stores & Events
- Let's Talk Books
Special Offers see all
More at Powell's
Recently Viewed clear list
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
This title in other editions
Other titles in the Cambridge Tracts in Theoretical Computer Science series:
Cambridge Tracts in Theoretical Computer Science #46: Domains and Lambda-Calculiby Roberto M. Amadio
Synopses & Reviews
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.
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Includes bibliographical references (p. -479) and index.
Table of Contents
Preface; Notation; 1. Continuity and computability; 2. Syntactic theory of thl-calculus; 3. D models and intersection types; 4. Interpretation of l-calculi in CCCâ€™s; 5. CCCâ€™s of algebraic Dcpoâ€™s; 6. The language PCF; 7. Domain equations; 8. Values and computations; 9. Powerdomains; 10. Stone duality; 11. Dependent and second order types; 12. Stability; 13. Towards linear logic; 14. Sequentiality; 15. Domains and realizability; 16. Functions and processes; Appendix A. Memento of recursion theory; Appendix B. Memento of category theory; Bibliography; Index.
What Our Readers Are Saying
Computers and Internet » Software Engineering » Programming and Languages