000			02086nmm a2200349Ia 4500
001			00006284
003			WSP
005			20220711214126.0
007			cr |uu|||uu|||
008			181214s2006 si a ob 001 0 eng d
010			_z 2007298163
040			_aWSPC _beng _cWSPC
020			_a9789812772596 _q(ebook)
020			_z9789812701428 _q(hbk.)
050	0	4	_aQA76.7 _b.S818 2006
072		7	_aCOM _x014000 _2bisacsh
082	0	4	_a005.13/1 _223
100	1		_aStreicher, Thomas, _d1958- _93864
245	1	0	_aDomain-theoretic foundations of functional programming _h[electronic resource] / _cThomas Streicher.
260			_aSingapore : _bWorld Scientific Publishing Co. Pte Ltd., _c©2006.
300			_a1 online resource (132 p.) : _bill.
538			_aSystem requirements: Adobe Acrobat Reader.
538			_aMode of access: World Wide Web.
588			_aTitle from web page (viewed December 14, 2018).
504			_aIncludes bibliographical references (p. 117-118) and index.
520			_a"This textbook provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. It introduces basic domain theory and the technique of logical relations as developed by Scott and Plotkin. The solution of recursive domain equations is explained in detail. A complete discussion of the famous full abstraction problem for PCF (a functional Kernel language due to Scott and Plotkin) is given including a construction of the fully abstract Milner model using Kripke logical relations. A final chapter introduces computability in Scott domains and shows that this model is fully abstract and universal for appropriate extensions of PCF by parallel language constructs."-- _cPublisher's website.
650		0	_aProgramming languages (Electronic computers) _xSemantics. _93865
650		0	_aComputer science _xMathematics. _93866
650		0	_aElectronic books. _920691
856	4	0	_uhttps://www.worldscientific.com/worldscibooks/10.1142/6284#t=toc _zAccess to full text is restricted to subscribers.
942			_cEBK
999			_c72538 _d72538