the Flexo-APPLY operator, and the Flexowriter has "yped out GO,the S-expressions for an APPLY triplet, f;x;p, should be typedon the Flexowriter. The typing is done by typing up to 72criarac ters (fewer if desired) followed by a carriage return.The Flexowriter then types out STOP and digests the informationto date.If a full triplet has not been completed, the Flexo-writer types out GO as a request for more of the triplet,triplet has been completed, the APPLY operator takes over andperli'orn!s il.e triplet, typins out the answer followed cy a GOrequesting the next triplet,If aTo stop the computation, one may respond to an initial GO,or to a GO following the use of the APPLY operator, or to a GOfollowing an error* (but not to a GO at other points, such asin the middle of list type-ins), by typing in+ STOPjThe Flexowriter then types - out STOF and returns control to thecontrol ?outine which types out GO and expects a direction type-in.One can then type eitherto end the run, orto return control to the card-reader for the next directioncard, e,g. TST, SET, FLX, FIN,*Such a GO w i l l hereafter be referred to as a "fresh" GO.
TEN-ModeThere are ten buffers of core storage for S-expressionsset aside for use by the TEN-Mode of operation. Pieces of anS-expression can be typed into these buffers in any sequence,with overwriting allowed, and the Flexo-APPLY operator can beasked to operate on any set of consecutive buffers, e.g. 0through 6, or 4 through 9.To use the TEN-Mode, one may respond to a "fresh" GO (seepreceding footnote) by typing in+ TEN>Then type in a number from 0 to 9 representing one of the tenbuffers, and then a tab, and then a (piece of a) S-expressionand then a carriage return, as inThe Flexowriter will then type out a colon, :, and one can typeinto another buffer register in the same way as above by typinga buffer-register number, a tab, the information, and finally acarriage re turn.When an entire triplet has been typed in, the APPLY operatorcan be called for by typing, in response to the colon type-out,the read-line direction,- RLN 3Then two numbers followed by a carriage return must be typed in,n1 n2 , e.g. 01 , or 69 , or 99 . All the buffer registers,nl to n2 inclusive, are then turned over to the read program,which reads them in, printing out the number of each register asit is read. When a complete triplet f;x;p has been found by theread program, the APPLY operator operates on the triplet, printsout the answer, and then returns control to the read program,
- 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: indicates carriage returnindicates
- 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 and 138:
9.2 Special Formsquote : machine la
- Page 139 and 140:
function[ f ] : machine language; s
- 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;