LISP I Programmer's Manual - Software Preservation Group

More documents

Recommendations

Info

Consider ~~~~~~[SHAKESPEARE;(UNDER,GREENWOOD,TREE);(GREENWOOD, TREE) 1There are two variables involved, GREENWOOD and TREE.Then the execution of format generates three functions towhich we could give argumentsshake speare [ SPREADING; CHESTNUT 1greenwood [ (BENEATH, SPREADING, CHESTNUT) 1tree [ (BENEATH, SPREADING, CHESTNUT) ]Executing these functions in turn gives(UNDER,SPREADING,CHESTNUT)SPREADINGand CHESTNUT respectively.Thus shakespeare has as argument a list u which must containas many terms as v; and substitutes in f for one occurrenceof each variable in v the corresponding variable in u,greenwood and tree have as argument a list structure gand pick out the element in g which occupies a position correspondingto their's in f.
function[ f ] : machine language; special formIf the first element of an S-expression is FUNCTION, thesecond element is understood to be the function. A new list isconstructed with first element FUNARG, second element equal tof, and third element equal to the current list of bound variables.1.e.Having such a list of bound variables carried along withthe function insures that the proper values of the bound variablesare used when the function is evaluated. Thusprog[pv; el; e2; e3; . . . ; e ] : machine language; special formnThe program feature is discussed in Section 4.5. For interestwe include here the program which the interpreter usesto work out a program given by the list pv of program variables,and the sequence, elye2,.*.,en of program statements.In the following p is the usual p-list of pairs, and estands for the entire list(pv,el'e2,e3," >en)'so that car[e] = pv.The program variables used below for the program -- for progare t2, p2,pr, and r.t2 = maplist[car[e];h[[ j];list[car[ NIL] 11p2 = append[t2;p]pr = cdr[e]r = prgo[atom[car[r] 1+ A~~;eq[caar[r];~~] GO;eq[caar[r];~~~uRN] + RET;T + NORM]
Page 1:
Artificial Intelli~cnce GroupJ. McC
Page 5:
Contents1 . Introduction ..........
Page 9 and 10:
2. Recursive Functions of Symbolic
Page 12 and 13:
expression was, defined, the meanin
Page 14:
Let f be an expression that stands
Page 17 and 18:
There is a twofold reason for depar
Page 19 and 20:
2, eq - 4eq[x;y] is defined if and
Page 21 and 22:
2. sub~t[x;~;z]This function gives
Page 23 and 24:
z;eq[caar[x];z]sub2[x;~];~((u1,vi)
Page 25 and 26:
The S-functLon apply is defined byI
Page 27 and 28:
The list p - could be eliminated, a
Page 29 and 30:
3. LISP PrimerThe features of LISP
Page 31 and 32:
The answer ( ((x A) B) (X A) ) will
Page 33 and 34:
one introducing it into the consequ
Page 35 and 36:
h,~~,pand)Y,SP5a. Rule4>: If j,++h,
Page 37 and 38:
to one of the 10 rules. The formula
Page 39 and 40:
(~111(LAMBDA( ~1 A2 A C) (COND ((NU
Page 41 and 42:
This causes the functions mentioned
Page 43 and 44:
4. The LISP Programming SystemIn th
Page 45 and 46:
Example 3:The following example, on
Page 47 and 48:
In either case, if a machine-langua
Page 49 and 50:
Note that the argument x starts wit
Page 51 and 52:
sion whose first element may be LAM
Page 53 and 54:
5 = (atomic function, arguments): C
Page 55 and 56:
- PROG is a special form described
Page 57 and 58:
When a list beginning with GO is en
Page 59 and 60:
Since the program feature will be u
Page 61 and 62:
and goes ahead after printing out(f
Page 63 and 64:
eturn[fn[a]In terms of the M-type n
Page 65 and 66:
( , SXD, G0011,4),LD&,G0002)( ,C;LA
Page 67 and 68:
push-down(MAPLIST,BSS, 0)( ,SXD,GOO
Page 69 and 70:
Ls.( ,O,U( ,STO,G0015)( , LXD, $FRE
Page 71 and 72:
Running a LISP ProgramIn this secti
Page 73 and 74:
SET :Note:FLX*:CRD*:FIN:This card w
Page 75 and 76:
Sense switches used:SWITCH NUMBERUS
Page 77 and 78:
The Flexowriter Sys tem (for M.1.T.
Page 79 and 80:
indicates carriage returnindicates
Page 81 and 82:
TEN-ModeThere are ten buffers of co
Page 83 and 84:
ErrorsTyping errors may be erased b
Page 85 and 86:
(from the tab type-in) will be proc
Page 87 and 88: answerTENCAR ((A@) 0- LINE NUMBER M
Page 89 and 90: 6. List StructuresMuch of the follo
Page 91 and 92: y either the list structure of Fig.
Page 93 and 94: which is represented asFirst we con
Page 95 and 96: the location of the association lis
Page 97 and 98: and the decrement of the TXL instru
Page 99 and 100: the 2's (8's) complement of an octa
Page 101 and 102: 25207 052567 05257025210 000000 000
Page 103: garbage collector does a linear swe
Page 106 and 107: The function collapse, is defined a
Page 108 and 109: THE TIME IS NOW 2/16 1139.7FUNCTION
Page 110 and 111: DEFINE( ( (RVRSE, (LAMBDA, (L ) JCO
Page 113 and 114: 8. Error Indications Given by LISPB
Page 115 and 116: Errors due to computer inadequacies
Page 117 and 118: Errors during the operation of the
Page 119 and 120: 9. Functions Available in LISPIn th
Page 121 and 122: s[x;y] : machine languageThe value
Page 123 and 124: eval[e;b] - : machine languageThe r
Page 125 and 126: Defining Functions:The argument of
Page 127 and 128: MORE]nconc[x;y]: machine languageTh
Page 129 and 130: evaluated functions. - map is used
Page 131 and 132: -ins t [x;y; z]: machine languageHe
Page 133 and 134: prog[prin2[d~rinl[~];The function p
Page 135 and 136: puncha[x] : machine languageThe fun
Page 137: 9.2 Special Formsquote : machine la
Page 141 and 142: desc[cdr[x];cdr[y]-desc[x;y] : mach
Page 143 and 144: eturn[^]intv[x] : machine language;
Page 145 and 146: The program for compsrch has the pr
Page 147 and 148: NIL;T+The value of - cpl is the loc
Page 149 and 150: --- ~reaterlp; q] : machine languag
Page 151 and 152: matrixmultiply[x;y] : machine langu
Page 153 and 154: 9.5 Alphabetic Index to FunctionsFu
Page 155 and 156: Function Page .mapcon .............
Page 157 and 158: GENERAL INDEXActive register, 96APP
Page 159 and 160: GENERAL INDEXFunctions, 3alphabetic
Page 161 and 162: GENERAL INDEXPropositionalcalculus;
show all

LISP I Programmer's Manual - Software Preservation Group

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?