Get Free Shipping on orders over $79
Domains and Lambda-Calculi : Cambridge Tracts in Theoretical Computer Science - No Information Available

Domains and Lambda-Calculi

By: No Information Available

Hardcover | 31 August 1998

At a Glance

Hardcover


RRP $279.95

$242.75

13%OFF

or 4 interest-free payments of $60.69 with

 or 

Ships in 5 to 7 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.
Industry Reviews
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

Other Editions and Formats

Paperback

Published: 15th May 2008

More in Mathematical Theory of Computation

Unveiling the Art of Steganography : A Modern Approach - Manoj Kumar
AI Value Creators : Beyond the Generative AI User Mindset - Dario Gil