Skip to content
Register Sign in Wishlist

Nominal Sets
Names and Symmetry in Computer Science

£48.99

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: May 2013
  • availability: In stock
  • format: Hardback
  • isbn: 9781107017788

£ 48.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Nominal sets provide a promising new mathematical analysis of names in formal languages based upon symmetry, with many applications to the syntax and semantics of programming language constructs that involve binding, or localising names. Part I provides an introduction to the basic theory of nominal sets. In Part II, the author surveys some of the applications that have developed in programming language semantics (both operational and denotational), functional programming and logic programming. As the first book to give a detailed account of the theory of nominal sets, it will be welcomed by researchers and graduate students in theoretical computer science.

    • The first book-length account of this exciting new topic
    • Authored by one of the pioneers of nominal sets
    • Prerequisites are basic, with some mathematical background provided
    Read more

    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: May 2013
    • format: Hardback
    • isbn: 9781107017788
    • length: 287 pages
    • dimensions: 235 x 156 x 20 mm
    • weight: 0.55kg
    • contains: 20 b/w illus. 80 exercises
    • availability: In stock
  • Table of Contents

    Preface
    Introduction
    Part I. Theory:
    1. Permutation
    2. Support
    3. Freshness
    4. Name abstraction
    5. Orbit finiteness
    6. Equivalents of Nom
    Part II. Applications:
    7. Inductive and conductive definitions
    8. Nominal algebraic data types
    9. Locally scoped names
    10. Functional programming
    11. Domain theory
    12. Computational logic
    References
    Notation index
    Index.

  • Resources for

    Nominal Sets

    Andrew M. Pitts

    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 lecturers whose faculty status has been verified. To gain access to locked resources, lecturers 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 lecturers 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. Lecturers 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.

  • Author

    Andrew M. Pitts, University of Cambridge
    Andrew Pitts FACM FBCS is Professor of Theoretical Computer Science at the University of Cambridge and a Fellow of Darwin College.

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