Warren's abstract machine : (Record no. 72866)

000 -LEADER
fixed length control field 03232nam a2200529 i 4500
001 - CONTROL NUMBER
control field 6267208
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204558.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151229s1991 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262255585
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- hc
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- pbk.
082 00 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author A�it-Kaci, Hassan,
245 10 - TITLE STATEMENT
Title Warren's abstract machine :
Sub Title a tutorial reconstruction /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (xvi, 114 pages) :
490 1# - SERIES STATEMENT
Series statement Logic programming
520 ## - SUMMARY, ETC.
Summary, etc This 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.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267208
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c1991.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [1991]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/29/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Prolog (Computer program language)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Logic programming.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Electronic digital computers.

No items available.