000			01829nam a22003137a 4500
001			sulb-eb0015741
003			BD-SySUS
005			20160405134443.0
008			110506s2013||||enk o ||1 0|eng|d
020			_a9781139084673 (ebook)
020			_z9781107017788 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.7 _b.P555 2013
082	0	0	_a005.13 _223
100	1		_aPitts, Andrew M., _eauthor.
245	1	0	_aNominal Sets : _bNames and Symmetry in Computer Science / _cAndrew M. Pitts.
264		1	_aCambridge : _bCambridge University Press, _c2013.
300			_a1 online resource (287 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	0		_aCambridge Tracts in Theoretical Computer Science ; _v57
500			_aTitle from publisher's bibliographic system (viewed on 04 Apr 2016).
520			_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.
776	0	8	_iPrint version: _z9781107017788
830		0	_aCambridge Tracts in Theoretical Computer Science ; _v57.
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9781139084673
942			_2Dewey Decimal Classification _ceBooks
999			_c37585 _d37585