000			03232nam a2200529 i 4500
001			6267208
003			IEEE
005			20220712204558.0
006			m o d
007			cr |n|||||||||
008			151229s1991 maua ob 001 eng d
010			_z 91010776 (print)
020			_a9780262255585 _qelectronic
020			_z9780262510585 _qprint
020			_z0262011239 _qhc
020			_z0262510588 _qpbk.
035			_a(CaBNVSL)mat06267208
035			_a(IDAMS)0b000064818b417e
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.73.P76 _bA38 1991eb
082	0	0	_a006.3 _220
100	1		_aA�it-Kaci, Hassan, _d1954- _921504
245	1	0	_aWarren's abstract machine : _ba tutorial reconstruction / _cHassan A�it-Kaci.
264		1	_aCambridge, Massachusetts : _bMIT Press, _cc1991.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1991]
300			_a1 PDF (xvi, 114 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aLogic programming
504			_aIncludes bibliographical references (p. [105]-107) and index.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aThis tutorial demystifies one of the most important yet poorly understood aspects of logic programming, the Warren Abstract Machine or WAM. The author's step-by-step construction of the WAM adds features in a gradual manner, clarifying the complex aspects of the design and providing the first detailed study of WAM since it was designed in 1983.Developed by David H. D. Warren, the WAM is an abstract (nonphysical) computer that aids in the compilation and implementation of the Prolog programming language and offers techniques for compiling and optimizing symbolic computing that can be generalized beyond Prolog. Although the benefits of the WAM design have been widely accepted, few have been able to penetrate the WAM. This lucid introduction defines separate abstract machines for each conceptually separate part of the design and refines them, finally stitching them together to make a WAM. An index presents all of the critical concepts used in the WAM. It is assumed that readers have a clear understanding of the operational semantics of Prolog, in particular, of unification and backtracking, but a brief summary of the necessary Prolog notions is provided.Contents: Introduction. Unification -- Pure and Simple. Flat Resolution. Prolog. Optimizing the Design. Conclusion. Appendixes.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/29/2015.
650		0	_aProlog (Computer program language) _921505
650		0	_aLogic programming. _92730
650		0	_aElectronic digital computers. _921506
655		0	_aElectronic books. _93294
710	2		_aIEEE Xplore (Online Service), _edistributor. _921507
710	2		_aMIT Press, _epublisher. _921508
776	0	8	_iPrint version: _z9780262510585
830		0	_aLogic programming _92730
856	4	2	_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267208
942			_cEBK
999			_c72866 _d72866