Description

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

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.

Nominal Sets Names and Symmetry in Computer Science 57 Cambridge Tracts in Theoretical Computer Science Series Number 57

Product form

£54.99

Includes FREE delivery

Order before 4pm tomorrow for delivery by Fri 23 Jan 2026.

A Hardback by Andrew M. Pitts

15 in stock


    View other formats and editions of Nominal Sets Names and Symmetry in Computer Science 57 Cambridge Tracts in Theoretical Computer Science Series Number 57 by Andrew M. Pitts

    Publisher: Cambridge University Press
    Publication Date: 5/30/2013 12:00:00 AM
    ISBN13: 9781107017788, 978-1107017788
    ISBN10: 1107017785
    Also in:
    Programming and scripting languages: general

    Description

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

    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.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account