Touretzky D.S. — Common LISP: a gentle introduction to symbolic computation :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Touretzky D.S. — Common LISP: a gentle introduction to symbolic computation

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Common LISP: a gentle introduction to symbolic computation

Автор: Touretzky D.S.

Аннотация:

This book is about learning to program in Lisp. Although widely known as the principal language of artificial intelligence research—one of the most advanced areas of computer science—Lisp is an excellent language for beginners. It is increasingly the language of choice in introductory programming courses due to its friendly, interactive environment, rich data structures, and powerful software tools that even a novice can master in short order.

Язык:

Рубрика: Computer science/Языки программирования/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1990

Количество страниц: 575

Добавлена в каталог: 22.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Recursion templates, conditional augmentation      258
Recursion vs. iteration      344 346
Recursion, art and literature examples      268
Recursion, data structures      283
Recursion, helping functions      266
recursive functions      231
Redefining structures      371
REDUCE operator      213 226 403
Remove      168 169 199
REMOVE-DUPLICATES      183
REMOVE-IF operator      210 226
REMOVE-IF-NOT operator      210 226
REMPROP      391
Replacing elements in a list      63
Rest      40 44
Rest arguments      361
Result of a function      1
Result of functions      1
RETURN      342
RETURN-FROM      353
Reversal lists      165
reverse      165 169 280 386
Robbie the Robot      188
Rock-Scissors-Paper game      125
Room      400
Rules of recursion      241 243
S-expressions      283
Scheme      xi
Scheme dialect      435
scope of variables      109
scoping      226
SCRAWL      187
SDRAW tool      186
SDRAW-LOOP      187
Searching tables with FIND-IF      207
second      39 46
Sequences      386 402
Sequential assignment, in DO*      351
Set      338
Set difference      173 211
SET-DIFFERENCE      173 200 211
SETF macro assigning to globals      138
SETF macro macroexpansion      406
SETF macro of AREF      385
SETF macro of SYMBOL-PLIST      402
SETQ special function, history      338
SETQ special function, macroexpansion of INCF      406
Sets examples      170
Sets removing duplicates      183
Shared structure      195
SHOWVAR example      413
Side effects      140 147 310
Side effects of functions      140
Significance of recursion      231
SIMPLE-STRING type      366
Simultaneous recursion      256
Simultaneous recursion templates      256
Single-test tail recursion      250
Single-test tail recursion templates      250
Special functions BLOCK      354
Special functions FUNCTION      225
Special functions IF      113
Special functions LET      141
Special functions LET*      144
Special functions QUOTE      104
Special functions SETQ      338
Special functions vs. macro functions      411
Special functions vs. ordinary functions      113
special variables      436 440
Splicing with backquote      414
sqrt      2
Square roots      2 416
stacks      310
Starship example      367
State transitions      419
STEP tool      130
Storing into arrays      385
Storing into CAR      315
Storing into CDR      332
Stream objects      294
STRING-CHAR type      366 403
STRINGP      288
strings      288 366 387 402
Structures as datatypes      365
SUB LIS      193 200
Subscripts in arrays      383
subset predicate      174
SUBSETP      174
subsets      174 210
Subsets of a set      174 210
subst      192 200 336
substitution ciphers      395
Subtraction      2
Suess, Dr.      268
Summarized evaluation rules      95
Summary of interesting properties of NIL      68
SYMBOL-PLIST      391 401
SYMBOL-VALUE      339
SYMBOLPZ      8
Symbols examples      6
Symbols, internal structure      105
Symmetric difference sets      181
Symmetric set difference      181
Symmetry of CONS and CAR/CDR      57
T as argument to FORMAT      289
T as logical value      132

T as output of predicates      8
T in COND clauses      117
T special meaning      7
T, internal representation      154
Tables and applicative operators      203
Tables examples      179
Tables extracting portions with MAPCAR      204
TAGBODY special function      427
Tail recursion      279
Tail recursive functions      279
Terminal nodes of trees      283
TERPRI      301
Test for membership in sets      170
Test part of a COND clause      116
third      39 46
Three rules of recursion      241 243
Tic-Tac-Toe      315 328
TIME macro      358
Tools, debugger      272
Tools, DESCRIBE      373 389
Tools, DRIBBLE      298
Tools, DTRACE      218 234 408
Tools, DUNTRACE      218
Tools, INSPECT      373 389
Tools, PPMX      407 426
Tools, ROOM      400
Tools, SCRAWL      187
Tools, SDRAW      186
Tools, SDRAW-LOOP      187
Tools, STEP      130
Tools, TIME      358
Tools, TRACE      216 234
Tools, UNTRACE      216
Top-level prompt      97
TRACE tool      216 234
Tracing macros      408
Transposing music      208
Trees as nested lists      192
Trees for arithmetic expressions      283
Trees, nonterminal nodes      283
Trees, S-expressions      283
Trees, terminal nodes      283
True-part (of IF conditional)      114
Truth      7
Truth functions LOGICAL-AND example      132
Truth functions XOR example      21
Truth tables      133
Two-part recursion      280
type hierarchy      366
Type predicate for numbers      8
Type predicate for symbols      8
Type predicates ATOM      67
Type predicates CONSP      66
Type predicates for structures      369 382
Type predicates KEYWORDP      199
Type predicates LISTP      66
Type predicates NULL      67
Type predicates NUMBERP      8
Type predicates STRINGP      288
Type predicates SYMBOLP      8
Type system      365
TYPE-OF      202 366
TYPEP      366
Types of errors      24
Unary arithmetic      70
Unary numbers      70
Unassigned variable error      120 137
Unbound variable      157
Undefined function error      120
union      173 200
Union sets      173
UNLESS macro      313
UNTRACE macro      217
Updating local variables      312
Updating methods for variables      309
Updating variables      312
Use of AND and OR to avoid errors      125
Use of macro functions during compilation      417
Use of tables with SUBLIS      193
USER package      151
Value cell symbols      153 339
Value cells      153 339
Variables in DO macro      347
Variables in DO*      351
Variables in LET      141
Variables in LET*      144
Vectors      383 387 403
vending machines      418 428
WARN      328
What is a function      1
WHEN macro      313
WITH-OPEN-FILE macro reading files      294
WITH-OPEN-FILE macro writing files      295
Wrong number of inputs error      24
Wrong-type input error      24 88
XOR truth function      22
Y-OR-N-P      293
YES-OR-NO-P      293
Zero divide error      24
Zero, factorial of      236
ZEROP      9 71
~% directive      289
~& directive      289
~A directive      290
~D directive      300
~F directive      300
~S directive      290

1 2 3

О проекте