Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Domains and Lambda-Calculi
  • Cited by 103
Publisher:
Cambridge University Press
Online publication date:
November 2011
Print publication year:
1998
Online ISBN:
9780511983504
DOI:
https://doi.org/10.1017/CBO9780511983504
Subjects:
Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic
Series:
Cambridge Tracts in Theoretical Computer Science (46)
Information

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

Reviews

Review 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 Source: Science of Computer Programming

Review 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 Source: Zentralblatt MATH

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.