HomeBooks

Browse
Search


By Subject
By Keyword
Related books and journals in this subject area
New titles published this year
Recent titles published within the last two years
All titles published in this subject area

Title Details
Binding: Hardback
Bibliographic information:
228 x 152 mm 500pp 85 line diagrams
ISBN: 0 521 62277 8
02 July 1998
Price: 50.00

 

 


Ordering instructions

Domains and Lambda Calculi
Roberto M. Amadio
Université de Provence, Marseille
and   Pierre-Louis Curien
ENS, Paris

Other titles in Cambridge Tracts in Theoretical Computer Science series

Description
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 modelling 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.

Chapter 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.



© Cambridge University Press 1998
Cambridge University Press,
Edinburgh Building,
Shaftesbury Road,
Cambridge CB2 2RU
Queen's Award for export achievement

© Cambridge University Press 1999
Cambridge University Press,
Edinburgh Building,
Shaftesbury Road,
Cambridge CB2 2RU

Contact the Press