000			01636nmm a2200181Ia 4500
008			220920s9999||||xx |||||||||||||| ||und||
020			_a9780511626364
082			_a005.13 _bR33T
100			_aReynolds, John C. _eAuthor _lEnglish _91813
245		0	_aTheories of Programming Languages _c/ by John C. Reynolds. _h[Electronic Resource]
260			_aCambridge _b: Cambridge University Press, _c1998
300			_axii 500p.
520			_aFirst published in 1998, this textbook is a broad but rigourous survey of the theoretical basis for the design, definition and implementation of programming languages and of systems for specifying and proving programme behaviour. Both imperative and functional programming are covered, as well as the ways of integrating these aspects into more general languages. Recognising a unity of technique beneath the diversity of research in programming languages, the author presents an integrated treatment of the basic principles of the subject. He identifies the relatively small number of concepts, such as compositional semantics, binding structure, domains, transition systems and inference rules, that serve as the foundation of the field. Assuming only knowledge of elementary programming and mathematics, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory and also will appeal to researchers and professionals in designing or implementing computer languages.
650			_aAlgorithmics _915699
650			_aComplexity _915700
856			_uhttps://doi.org/10.1017/CBO9780511626364 _qPDF _yClick to Access the Online Book
942			_cEBK _nYes
999			_c12228 _d12228