Nominal Sets
Names and Symmetry in Computer Science

The first detailed account of the basic theory and applications of nominal sets.

Andrew M. Pitts (Author)

9781107017788, Cambridge University Press

Hardback, published 30 May 2013

287 pages, 20 b/w illus. 80 exercises
23.5 x 15.6 x 2 cm, 0.55 kg

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.

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.

Subject Areas: Computer science [UY], Programming & scripting languages: general [UMX]