000			03315nam a2200493 i 4500
001			6267234
003			IEEE
005			20190220121645.0
006			m o d
007			cr |n|||||||||
008			151223s1991 maua ob 001 eng d
010			_z 91010011 (print)
020			_a9780262255875 _qelectronic
020			_z0262521601 _qprint
020			_z9780262521604 _qprint
022			_a0953-7767
035			_a(CaBNVSL)mat06267234
035			_a(IDAMS)0b000064818b41de
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.7 _b.B87 1991eb
082	0	0	_a005.1 _220
100	1		_aBurn, Geoffrey, _eauthor.
245	1	0	_aLazy functional languages : _babstract interpretation and compilation / _cGeoffrey Burn.
264		1	_a _bMIT Press, _c1991.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1991]
300			_a1 PDF (238 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aResearch monographs in parallel and distributed computing
504			_aIncludes bibliographical references (p. 213-223) and index.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aThe class of programming languages commonly known as functional includes Lisp, Scheme, ML, and Miranda TM. This book explores a subclass known as lazy functional languages, beginning with the theoretical issues and continuing through abstract interpretation and offering improved techniques for implementation.Now that advanced compiler technology has made it possible for lazy functional languages to compare favorably in run-time with more traditional languages such as C and Pascal, this monograph tackles problems of implementation such as time and memory overheads and restrictions on parallelism. Specifically, it describes a more efficient implementation model, the evaluation transformer model, that can be used when information is known about how functions use their arguments, develops a semantically sound analysis technique called abstract interpretation, which can determine this information, and shows how to use the information to compile more efficient code for sequential and parallel machines.Geoffrey Burn is Lecturer at Imperial College of Science, Technology, and Medicine, London.Contents: Introduction. Operational and Denotational Semantics of the Typed Lambda Calculus. A Framework for the Abstract Interpretation of Functional Languages. Some Example Abstract Interpretations. Evaluation Transformers. Implementing Functional Languages on Sequential and Parallel Machines. Relationship to Other Work. Epilogue. Appendixes: Additional Proofs. The Spineless G-Machine.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aFunctional programming languages.
655		0	_aElectronic books.
710	2		_aIEEE Xplore (Online Service), _edistributor.
710	2		_aMIT Press, _epublisher.
776	0	8	_iPrint version _z9780262521604
830		0	_aResearch monographs in parallel and distributed computing
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267234
999			_c39150 _d39150