Skip to content
Register Sign in Wishlist
Domains and Lambda-Calculi

Domains and Lambda-Calculi

$206.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: August 1998
  • availability: Available
  • format: Hardback
  • isbn: 9780521622776

$ 206.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
Paperback


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Covers both operational and denotational semantics
    • Comprehensive and balanced view
    • Class tested in graduate classes
    Read more

    Reviews & endorsements

    "...the book is well written and will be clear to readers with sufficient mathematical maturity." Computing Reviews

    "...fills a gap in the literature, giving us a wide perspective of the development of domain theory...self-contained and amazingly clear in many respects...an excellent survey, and recommended reading, for those who have been exposed to the subject and seek a good technical introduction to advanced topics..." Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: August 1998
    • format: Hardback
    • isbn: 9780521622776
    • length: 504 pages
    • dimensions: 235 x 158 x 30 mm
    • weight: 0.954kg
    • contains: 85 b/w illus.
    • availability: Available
  • 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.

  • Resources for

    Domains and Lambda-Calculi

    Roberto M. Amadio, Pierre-Louis Curien

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact lecturers@cambridge.org.

  • Authors

    Roberto M. Amadio, Université de Provence

    Pierre-Louis Curien, Ecole Normale Supérieure, Paris

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×