UID:
almafu_9959234314302883
Format:
1 online resource (xiii, 276 pages) :
,
digital, PDF file(s).
Edition:
1st ed.
ISBN:
1-139-89077-8
,
1-107-24758-6
,
1-107-25007-2
,
1-107-01778-5
,
1-139-08467-4
,
1-107-24924-4
,
1-107-24841-8
,
1-107-25090-0
Series Statement:
Cambridge tracts in theoretical computer science ; 57
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
,
Introduction -- Part One : Theory. Permutations -- Support -- Freshness -- Name abstraction -- Orbit-finiteness -- Equivalents of Nom -- -- Part Two : Applications. Inductive and coinductive definitions -- Nominal algebraic data types -- Locally scoped names -- Functional programming -- Domain theory -- Computational logic.
,
English
Additional Edition:
ISBN 1-299-70747-5
Additional Edition:
ISBN 1-107-24131-6
Language:
English
URL:
https://doi.org/10.1017/CBO9781139084673
