+612 9045 4394
Domains and Lambda-Calculi : Cambridge Tracts in Theoretical Computer Science - Roberto M. Amadio

Domains and Lambda-Calculi

Cambridge Tracts in Theoretical Computer Science

Hardcover Published: 2nd July 1998
ISBN: 9780521622776
Number Of Pages: 504

Share This Book:


RRP $260.00
or 4 easy payments of $62.06 with Learn more
Ships in 15 business days

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.

From reviews of the hardback: '... extremely useful as a reference for classical results and techniques in general domain theory, very balanced in the treatment of mathematical properties of domains and their operational motivations and applications, and always deep in the choice of topics and in unravelling the connections between them.' Felice Cardone, Science of Computer Programming From reviews of the hardback: 'This is an excellent, thorough monograph ... a rich and comprehensive source of information, it is very useful as a reference to classical results in domain theory and lambda calculus.' Paula G. Severi, Zentralblatt MATH

Continuity and computability
Syntactic theory of thl-calculus
D models and intersection types
Interpretation of l-calculi in CCC's
CCC's of algebraic Dcpo's
The language PCF
Domain equations
Values and computations
Stone duality
Dependent and second order types
Towards linear logic
Domains and realizability
Functions and processes
Memento of recursion theory
Memento of category theory
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521622776
ISBN-10: 0521622778
Series: Cambridge Tracts in Theoretical Computer Science
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 504
Published: 2nd July 1998
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 22.8 x 15.2  x 3.2
Weight (kg): 0.91