000 | 03291nam a2200469 i 4500 | ||
---|---|---|---|
001 | 6267461 | ||
003 | IEEE | ||
005 | 20220712204712.0 | ||
006 | m o d | ||
007 | cr |n||||||||| | ||
008 | 151223s1962 maua ob 001 eng d | ||
020 |
_a9780262287722 _qelectronic |
||
020 |
_z9780262130110 _qprint |
||
035 | _a(CaBNVSL)mat06267461 | ||
035 | _a(IDAMS)0b000064818b448d | ||
040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
050 | 4 |
_aQA76.73.L23 _b.L5 1985eb |
|
245 | 0 | 0 |
_aLISP 1.5 programmer's manual / _cthe Computation Center and Research Laboratory of Electronics, Massachusetts Institute of Technology ; John McCarthy ... [et al. ; written by Michael I. Levin]. |
264 | 1 |
_aCambridge, Massachusetts : _bMIT Press, _c1985. |
|
264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1962] |
|
300 |
_a1 PDF (vi, 106 pages) : _billustrations. |
||
336 |
_atext _2rdacontent |
||
337 |
_aelectronic _2isbdmedia |
||
338 |
_aonline resource _2rdacarrier |
||
500 | _a"The over-all design of the LISP Programming System is the work of John McCarthy and is based on his paper 'Recursive Functions of Symbolic Expressions and Their Computation by Machine' which was published in Communications of the ACM, April 1960"--Pref. | ||
500 | _a"The 'LISP 1 Programmer's Manual', March 1, 1960, was written by Phyllis A. Fox."--Pref. | ||
500 | _aIncludes index. | ||
506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
520 | _aThe LISP language is designed primarily for symbolic data processing used for symbolic calculations in differential and integral calculus, electrical circuit theory, mathematical logic, game playing, and other fields of artificial intelligence.The manual describes LISP, a formal mathematical language. LISP differs from most programming languages in three important ways. The first way is in the nature of the data. In the LISP language, all data are in the form of symbolic expressions usually referred to as S-expressions, of indefinite length, and which have a branching tree-type of structure, so that significant subexpressions can be readily isolated. In the LISP system, the bulk of the available memory is used for storing S-expressions in the form of list structures. The second distinction is that the LISP language is the source language itself which specifies in what way the S-expressions are to be processed. Third, LISP can interpret and execute programs written in the form of S-expressions. Thus, like machine language, and unlike most other high level languages, it can be used to generate programs for further executions. | ||
530 | _aAlso available in print. | ||
538 | _aMode of access: World Wide Web | ||
588 | _aDescription based on PDF viewed 12/23/2015. | ||
650 | 0 |
_aLISP (Computer program language) _921828 |
|
655 | 0 |
_aElectronic books. _93294 |
|
700 | 1 |
_aLevin, Michael I. _922933 |
|
700 | 1 |
_aMcCarthy, John, _d1927-2011. _922934 |
|
710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _922935 |
|
710 | 2 |
_aMassachusetts Institute of Technology, _epublisher. _922936 |
|
776 | 0 | 8 |
_iPrint version _z9780262130110 |
856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267461 |
942 | _cEBK | ||
999 |
_c73115 _d73115 |