Umfang:
1 Online-Ressource (xiii, 276 pages)
,
digital, PDF file(s)
ISBN:
9781139084673
Serie:
Cambridge tracts in theoretical computer science 57
Inhalt:
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
Inhalt:
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
Anmerkung:
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Weitere Ausg.:
ISBN 9781107017788
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe ISBN 9781107017788
Sprache:
Englisch
DOI:
10.1017/CBO9781139084673
