Domains and Lambda Calculi

Domains and Lambda Calculi

by Roberto M. Amadio, Pierre-Louis Curien
     
 

View All Available Formats & Editions

ISBN-10: 0521622778

ISBN-13: 9780521622776

Pub. Date: 05/28/2003

Publisher: Cambridge University Press

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

Overview

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.

Product Details

ISBN-13:
9780521622776
Publisher:
Cambridge University Press
Publication date:
05/28/2003
Series:
Cambridge Tracts in Theoretical Computer Science Series, #46
Pages:
500
Product dimensions:
5.98(w) x 8.98(h) x 1.26(d)

Table of Contents

Preface; Notation; 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; 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 1: summary of recursion theory; Appendix 2: summary of category theory; References and bibliography; Index.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >