000			02059nam a22003378i 4500
001			CR9780511609619
003			UkCbUP
005			20200124160247.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090910s1992||||enk o ||1 0|eng|d
020			_a9780511609619 (ebook)
020			_z9780521416955 (hardback)
020			_z9780521033114 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.76.C65 _bA67 1992
082	0	0	_a005.4/53 _220
100	1		_aAppel, Andrew W., _d1960- _eauthor.
245	1	0	_aCompiling with continuations / _cAndrew W. Appel.
264		1	_aCambridge : _bCambridge University Press, _c1992.
300			_a1 online resource (x, 262 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aThe control and data flow of a program can be represented using continuations, a concept from denotational semantics that has practical application in real compilers. This book shows how continuation-passing style is used as an intermediate representation on which to perform optimisations and program transformations. Continuations can be used to compile most programming languages. The method is illustrated in a compiler for the programming language Standard ML. However, prior knowledge of ML is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the producton of practical optimising compilers for modern languages like ML. This book will be essential reading for compiler writers in both industry and academe, as well as for students and researchers in programming language theory.
650		0	_aCompilers (Computer programs)
630	0	0	_aStandard ML of New Jersey.
776	0	8	_iPrint version: _z9780521416955
856	4	0	_uhttps://doi.org/10.1017/CBO9780511609619
999			_c519085 _d519083