Nominal Sets
Nominal Sets
Names and Symmetry in Computer Science
AUD$106.95
inc GSTHardback
USD
eBook
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
Product details
May 2013Hardback
9781107017788
287 pages
235 × 156 × 20 mm
0.55kg
20 b/w illus. 80 exercises
Available
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.
Displaying 1 - 1 of 1
