LEADER 03155nam  22006492  450 
001 9910464929203321
005 20151005020624.0
010   $a1-139-89077-8
010   $a1-107-24758-6
010   $a1-107-25007-2
010   $a1-107-01778-5
010   $a1-139-08467-4
010   $a1-107-24924-4
010   $a1-107-24841-8
010   $a1-107-25090-0
035   $a(CKB)3460000000128924
035   $a(SSID)ssj0000971944
035   $a(PQKBManifestationID)11567856
035   $a(PQKBTitleCode)TC0000971944
035   $a(PQKBWorkID)10946067
035   $a(PQKB)10010530
035   $a(UkCbUP)CR9781139084673
035   $a(MiAaPQ)EBC1357339
035   $a(Au-PeEL)EBL1357339
035   $a(CaPaEBR)ebr10718516
035   $a(CaONFJC)MIL501998
035   $a(OCoLC)852456485
035   $a(EXLCZ)993460000000128924
100   $a20110506d2013||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aNominal sets $enames and symmetry in computer science /$fAndrew M. Pitts$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2013.
215   $a1 online resource (xiii, 276 pages) $cdigital, PDF file(s)
225 1 $aCambridge tracts in theoretical computer science ;$v57
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a1-299-70747-5 
311   $a1-107-24131-6 
320   $aIncludes bibliographical references and indexes.
327   $aIntroduction -- 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.
330   $aNominal 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.
410  0$aCambridge tracts in theoretical computer science ;$v57.
606   $aProgramming languages (Electronic computers)$xSemantics
606   $aProgramming languages (Electronic computers)$xSyntax
615  0$aProgramming languages (Electronic computers)$xSemantics.
615  0$aProgramming languages (Electronic computers)$xSyntax.
676   $a005.13
700   $aPitts$b A. M$g(Andrew M.),$0853661
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910464929203321
996   $aNominal sets$91906058
997   $aUNINA