|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| Touretzky D.S. — Common LISP: a gentle introduction to symbolic computation |
|
|
|
| Предметный указатель |
&AUX keyword 364
&BODY keyword 429
&KEY keyword 363
&OPTIONAL keyword 360 409
&REST keyword 361
*PRINT-ARRRAY* 385
*PRINT-BASE* 441
*PRINT-CIRCLE* 441
*TERMINAL-IO* 294
:COUNT keyword 199 226
:DIRECTION keyword 295
:ELEMENT-TYPE keyword 403
:FROM-END keyword 199 226
:INCLUDE keyword 381
:INITIAL-CONTENTS keyword 386
:INITIAL-ELEMENT keyword 386
:PRINT-FUNCTION keyword 378
:TEST keyword 200 336
A-lists (association lists) 179
ABS (absolute value) 2 114
Accessing structures 369
Accessor functions 369 382
Actions in a COND clause 360
ADD1 example 12
Addition 2 71
Addresses comparing with EQ 196
Addresses of compiled code objects 105
Addresses of symbols 195
Addresses stored in cons cells 43
Algol 341
AND macro DeMorgan’s theorem 134
AND macro use as a conditional 125
AND macro vs. LOGICAL-AND 132
AND macro, examples 122
AND macro, interchangeability with other conditionals 126
APOSTROPHE see quoting
APPEND 161 164 169 280 335 337
Applicative operator EVERY 214
Applicative operator FIND-IF 207
Applicative operator MAP 403
Applicative operator MAPCAR 202 224
Applicative operator REDUCE 213
Applicative operator REMOVE-IF 210
Applicative operator REMOVE-IF-NOT 210
Applicative operator, graphical representation 203 207 210 214 216
Applicative operators and eval notation 77
Applicative operators creating 229 282
Applicative operators operating on multiple lists 224
Applicative operators overview 201
apply 110 111 225 362
apropos 151
Arcs in finite state machines 419
AREF 385
Argument list in function definition 82
Arguments of functions 80
Arguments of macros 409
Arguments of special functions 104 411
Arithmetic errors 24
arithmetic expressions 283
Arithmetic functions 2
Arithmetic unary, with lists 70
Arrays headers 384
Arrays, accessing 385
arrays, creating 383 403
arrays, initializing 386
Arrays, printing 385
Art, recursion in 268
artificial intelligence 27
Assertions in a database 219
Assignment in loops 345
Assignment to local variables 312
Assignment using generalized variables 315
Assignment variables 307
Assignment with INCF or DECF 309
Assignment with PUSH and POP 310
Assignment with SETF 138 307
Assignment with SETF macro 307
assoc 179 183 197 200 207
ASSOC function tables 179
Association lists 179 388
Asterisk convention 308
atom 67
Atomic datatypes 67
Augmenting recursion 252
Automobile diagnosis 374
Auxiliary variables 364
Backquote character 412
backtrace 272
Binary trees 285
Binding of variables 157 347
Binding variables 157
BLOCK special function 354
Block structure 353
Blocks world databases 219
Blocks world examples 178 181 219 337
Body of a function 82 140
Boole, George 132
Boolean functions 132
boolean functions, examples 132
boolean functions, logical completeness 135
Boolean functions, truth tables 133
Box notation 1 77 79
break 272
Buckets in hash tables 389
built-in functions 12
CAAR 49
CADDR 46
cadr 46
CAR and CDR of nested lists 47
CAR and CDR of NIL 50
CAR function 43
CAR of dotted pairs 75
CAR of nested lists 47
CAR of NIL 50
CAR part of cons cell 43
CAR symmetry with CONS 57
CAR use in NTH 167
Car/cdr recursion 262
Cardinality of a set 175
Cardinality sets 175
Cards and applicatives 212
Carriage return in FORMAT 289
Cascading functions 56
Cascading of CONS 56
Case distinctions and EQUALP 381
Cat in the Hat 268
CDAR 46
CDDR 47
CDR function 43
CDR of dotted pairs 75
CDR of nested lists 47
CDR of NIL 50
CDR of single-element lists 44
CDR of unary numbers 70
CDR part of cons cell 43
CDR symmetry with CONS 57
CERROR 328
Character objects 387 402
character strings 288
Church, Alonzo 106
ciphers 395
Circular lists 74 248 303 334
Clauses in AND 122
Clauses in COND 116
Clauses in OR 122
Clauses, use of T as the test 117
CLOS (Common Lisp Object System) 365
Closure objects 206 225 226 230
CLRHASH 398
COERCE 402
| Collatz’s conjecture 247
Comma with backquote 412
Comments in programs 150
Common Lisp 28
compile 415
COMPILE-FILE 415
Compiled function objects 202
Compilers for finite state machines 428
Compilers for Lisp 415
Completeness of boolean functions 135
Complex predicates 123
Composite numbers 285
Concatenation of lists 161
COND macro in complex predicates 123
COND macro in recursive functions 242
COND macro interchangeability with IF 126
COND macro, consequent part 116 360
COND macro, examples 116
COND macro, side effects in consequent part 308 (See also IF)
Conditional augmentation 258
Conditionals, AND 122
Conditionals, COND 116
Conditionals, IF 113
Conditionals, making decisions 113
Conditionals, OR 122
Cons cells, circular structures 74 248 303 334
CONS function and NIL 55
CONS function relation to LIST and APPEND 164
CONS function symmetry with CAR/CDR 57 (See also CAR CDR LIST)
CONS function, asymmetry of arguments 160
CONS function, building nested lists 56
CONS function, examples 52
Consequent part of a COND clause 116
CONSP 66
Constants 150
Constructing new lists 52 58 89
Constructing new nested lists 56
constructor functions 368 370
Control characters 97
Control structures, applicative operators 201
Control structures, conditionals 113
Control structures, iteration 341
Control structures, recursion 231
craps (dice game) 151
Creating structures 368
Cryptogram exercise 395
Ctrl key 97
Cursor position, for output 289
DATA 1
Debugger 272
DECF macro 309
Decision making in programs 113
Declarations 418 436
DEFCONSTANT macro 439
Defined EVAL notation 77
Defined predicates 8
Defining constants 439
defining functions 12 82
Defining functions with DEFUN 82
Defining macro functions 408
defining macros 408
Defining new functions 12
Defining parameters 439
Defining special variables 436
Defining structures 367
Definition of a number 7
Definition of a symbol 7
DEFMACRO macro 408
DEFPARAMETER macro 439
DEFSTRUCT macro 367 378 381 406
DEFUN macro 82 95 205
DEFVAR macro 436 439
DELETE 337
DeMorgan’s theorem 134
Demorgan’s theorem and conditionals 134
DeMorgan’s theorem on boolean functions 134
Deoxyribonucleic acid (DNA) 355
Depth of cons cell structure 44 254
Depth of parenthesization 33 266
describe 373
Destructive concatenation 335
Destructive operations on cons cells 334 335 336
Destructive operations on lists 332 334 335 336
Destructive operations on sequences 386
Destructive operations on strings 387
Destructuring 430
Destructuring macro functions 430
Deviant list structures 74
Diagnosis problems 374
Dice exercise 151
Discrimination nets 374
Division by zero 24
Division function 2
DNA exercise 355
DO macro 347 349 352 427
DO with empty body 348
DO* macro 351
Documentation 149
Documentation string 150
DOLIST macro 341 346
dot notation 303
DOTIMES macro 341 427
Dotted pairs, examples 72 78
Dotted pairs, hybrid notation 304
Dotted pairs, use with SUBLIS 193 (See also Cons cell)
Double-test tail recursion 250
Double-test tail recursion templates 250
DOVECTOR example 431
Dragon stories 232 236 238 241 244
Drawing Hands lithograph 268
DRIBBLE 298
DTRACE tool 218 234 408
DUNTRACE macro 218
Dynamic binding 438
Dynamic scoping 158 435
Efficiency of list operations 194
Elegance in programming 310 312 344 349
Elements of a list 31
Empty argument list 103
Empty argument lists 103
Empty list 37 55
End-of-file conditions 302
Entries in tables 179
eq 195 302 390
EQL 197 336
equal 10 195 336 380
Equality of addresses 196
Equality of lists 38
Equality of numbers 197
Equality of sets 175
Equality of strings 198
Equality of structures 380
Equality of symbols 10
Equality sets 175
Equality tests of structures 380
EQUALP 198 381
Error 326
errors, division by zero 24
Errors, misdefining functions 91
Errors, misuse of parentheses in COND 120
Errors, misuse of quotes 87
Errors, non-list input 36 40
Errors, unassigned variable 120
Errors, undefined function 120
Errors, wrong-number-of-inputs 24
Errors, wrong-type input 24 88
Escher, M. C. 268
eval function 78 110
EVAL notation vs. box notation 79
Evaltrace diagrams 81 88 109 127 141 142 143 144 145 146 155 156 227 228 410 434
|
|
|
| Реклама |
|
|
|
|
|
О проекте