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

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

blank
blank
blank
Красота
blank
Eisenberg M., Abelson H. — Programming in Scheme
Eisenberg M., Abelson H. — Programming in Scheme

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

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



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


Название: Programming in Scheme

Авторы: Eisenberg M., Abelson H.

Аннотация:

"With this book you can learn to write good programs that do interesting things right off the bat," writes software developer Julie Sussman. "This is the introductory [programming] text that I wish I had had"

Scheme - a simple, learnable dialect of LISP has emerged as a popular educational language as well as a serious tool for producing applications and system software. Programming in Scheme provides an accessible introduction to Scheme that assumes no previous programming experience and covers all the basics of the language and many advanced topics as well. It gets readers on the machine early, teaches language structure and programming technique through extended examples an exercises, and emphasizes debugging throughout.

Chapters are organized as a series of groups, or "layers," each of which advances the reader to a new level in Scheme. The first layer (chapters 2-7) introduces Scheme procedures - how to define, use, and debug them. The second layer (chapters 8-10) discusses lists and subprocedures. The third layer (chapters 11-15) provides a more elaborate and powerful model of the Scheme language. These last chapters also explore the notion of first-class procedure objects, one of the most fascinating ideas in computer science. Appendixes contain an Edwin mini-manual, answers to selected exercises, references and bibliography.

Michael Eisenberg is a Ph.D candidate in Computer Science at MIT. Harold Abelson is Associate Professor of Computer Science and Engineering at MIT.


Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
#f (boolean)      33
#t (boolean)      33
$()$ (boolean)      90 97
$*$ (primitive)      18
$+$ (primitive)      9
$-$ (primitive)      18
$-l+$ (primitive)      26
$/$ (primitive)      18
$<$ (primitive)      33
$<=$ (primitive)      39 (E 4.10)
$<>$ (primitive)      39 (E 4.10)
$=$ (primitive)      33
$>$ (primitive)      33
$>=$ (primitive)      39 (E4.10)
$l+$ (primitive)      26
*the-non-printing-object* (variable)      71
4th-power      162
8th-power      163
Abbott, Bud      112 119 120 10.4)
Abelson, Harold      2n 19n
abs (primitive)      30 (E 3.13)
acos (primitive)      30 (E 3.13)
Actor model to understand continuations      253
Actor model to understand recursion      42-44 52
add-in-current-base      192 (E 13.5)
add-into!      194 (E 13.10) 291
add-list-of-assertions!      240 (E 15.9)
add-new-assertion!      235
add-new-rule!      240 (E 15.11) 292
add-new-string!      194 (E 13.11)
add-reminder!      263 (E 16.4)
add-to-counter      182
add-vegetable!      190 (E 13.1)
Algol 60      107n
Aliasing      see Sharing
all-positives?      169 (E 12.15)
alternative-name-for      270 (E 16.20)
and (special form)      33
answer-me      98 (E 8.10)
any-good-fragments?      114
apparent-context      119
append (primitive)      86 88 195
append: (primitive)      195 (E 13.13)
appiy-to-1      168 (E 12.8)
apply (primitive)      229
apply-but-with-limit      152
apply-to-3      149-152
apply-to-random-element      166 (E 12.3) 288
area-code      96 (E 8.1)
Arguments      11 18
Arguments, order of evaluation      43
Arrays      241 (see also Vectors)
Artificial intelligence (AI)      2 (see
asin (primitive)      30 (E 3.13)
ask-user-for-todays-date!      191 (E 13.4) 290
assoc (primitive)      239 (E 15.3)
Association lists      see Lists
assq (primitive)      220 238
assv (primitive)      239 (E 15.3)
atan (primitive)      30 (E 3.13)
atom? (primitive)      219
atomic-weight      93
atoms-in-molecule      100 (E 8.18)
Average      98 (E 8.8) 285
average-n-roulette-spins      61 65
Banks, Roger      54 (E 5.4)
baseball-statistics      29 (E 3.10)
batting-avg      29 (E 3.10) 283
better-try      174
big-negative-integer?      172 (E 12.19)
Bindings, altering with set!      173-175
Bindings, and Scheme environments      123-129
Bindings, as created by define      20
Bindings, as created by procedure application      129-131
Bindings, lexical scoping of (in Scheme)      107-108 (see also Lexical scoping)
Birtwistle, G.M.      184n
bkpt (special form)      203-204 212
Block structure      3 105-108
body      175-176
boolean? (primitive)      270 (E 16.22)
Booleans      33
Booleans, evaluation of      33
break (primitive)      213 (E 13.5)
break-both (primitive)      213 (E 13.5)
break-entry (primitive)      213 (E 13.5)
break-exit (primitive)      213 (E 13.5)
Breakpoints, definition of      203-204
Breakpoints, in recursive procedures      207-208
Breakpoints, introduced by bkpt      203-204
Breakpoints, sample uses of      210-212
bridge-dealer      169 (E 12.14)
Bridge-hand-displaying program      250-252
Bugs      see also Breakpoints Error Inspector
Bugs, created by altering bindings or pairs      177 181-183
Bugs, from neglecting special cases      61
Bugs, healthy reaction to      57-58
Bugs, in recursive procedures      59-60
Bugs, preventing      64-65
Bugs, semantic sources of      59
Bugs, syntactic sources of      58-59
Bugs, type errors      60
C-curve      199 (E 13.18)
cadr (primitive)      93
call-with-current-continuation (primitive)      253
call/cc (primitive)      253
car (primitive)      80
case (special form)      93 99
Case-insensitivity (in Scheme's handling of symbols)      91
cddr (primitive)      93
cdr (primitive)      80 85
ceiling (primitive)      27
Ceruzzi, Paul      111
change-cl-to-c2      201 (E 13.21)
change-name!      176
change-question-to-a      201 (E 13.21)
change-some-global-to      259
char-ci<? (primitive)      202 (E 13.21)
char-ci=? (primitive)      202 (E 13.21)
char-ci>? (primitive)      202 (E 13.21)
char<? (primitive)      202 (E 13.21)
char=? (primitive)      201 (E 13.21)
char>? (primitive)      202 (E 13.21)
char? (primitive)      202 (E 13.21)
check-all-predicates      171-172 (E 12.19)
check-assertions-for-each-dictionary      224
choose-pen-color      77
Church, Alonzo      156
circle-area      22 140
circle-squared      75 192 258
Circle-squared program      67-78 192 257-258 268
Circle-squared program, implementation of      72-77
Circle-squared program, mathematical issues      76
Circle-squared program, origins of      67
Circular lists      180-181
circularize!      181
clear-graphics (primitive)      70-71
clear-point (primitive)      68
Clinger, William      158n
close-enough?      51
close-input-port (primitive)      256
close-output-port (primitive)      256
close?      37 (E 4.4) 284
COLOR      36
Color Graphics Adaptor (CGA)      3 67 70 252
Comments      65
Common Lisp      2
compare-with-bet      13 33 103
COMPOSE      169 (E 12.15) 289
Compound expressions      10
cond (special form)      35-37
Conditional choices      31-32
cone-volume      22
connect-the-dots      99 (E 8.13)
Connett, John E.      67
cons (primitive)      80 85
contains-olives?      91
context-part      118
context-response-part      118
context-words      119
continuation-test      265 (E 16.12)
Continuations (as Scheme objects)      252-255 265-267
Continued fractions      49-51
conversation-boundary?      140 (E 11.3) 287-288
cos (primitive)      27
cos-maker      170 (E 12.16)
Costello, Lou      112 119 120 10.4)
count-down      65 (E 6.2)
count-number-of-factors      55 (E 5.8)
count-prime-factors      284
count-prime-factors-helper      284
Cryptograms      171 (E 12.17)
cube      131 159
cube-root      169 (E 12.13)
cue-part      117
cylinder-volume      22
Day      82
day-after      181
Debugger      9 (see also Inspector)
define (special form)      10 19-20 157-158
delete! (primitive)      194 (E 13.9)
delete-n-random-elements      163
delete-random-element      163
delq      194 (E 13.9)
delq! (primitive)      194 (E 13.9)
describe-temperature      39 (E 4.9)
Dewdney, A.K.      67
display (primitive)      25 250 267
display-bridge-hand      251
display-many-lines      274-275
display-suit      251
distance-between-points      29 (E 3.7)
divisible?      34-35
DNA      100 (E 8.21)
do-all-rules      234
do-all-rules-repeatedly      234
do-and-clauses      224
do-one-rule      233
do-or-clauses      225
do-test      267 (E 16.15)
Dotted-pair notation      80 84
double      22 131 148
draw-line-to (primitive)      69
draw-one-row      268 (E 16.17)
draw-point (primitive)      68
draw-point-from-pair      154
draw-rows      268 (E 16.17)
draw-square      71
Editor      see Edwin editor
edwin (primitive)      10-12
Edwin editor, bare-bones description of      11-12
Edwin editor, mini-manual for      271-281
Edwin editor, mini-manual for, control and meta commands      271-272
Edwin editor, mini-manual for, cursor movement      272-273
Edwin editor, mini-manual for, files, working with      277-278 280-281
Edwin editor, mini-manual for, incremental search      275-277
Edwin editor, mini-manual for, killing and unkilling text      273-275
Edwin editor, mini-manual for, Scheme and      278-279
Edwin editor, pragmatics of using      9 24-25
Edwin editor, requirements for using      3
Edwin editor, saving and retrieving files      14 277-278
Edwin editor, using tab key in      see tab key
ELIZA      111-112
end-of-year?      291
endpoint-1      96 (E 8.3)
endpoint-2      96 (E 8.3)
Environments, accessible through breakpoints      203-204 208 213
Environments, as Scheme objects      243-247 16.5-E
Environments, bindings within      123-129
Environments, definition of      125-127
Environments, diagrams depicting      125-127 136-137
Environments, evaluating compound procedure calls      139
Environments, evaluating expressions within      124-125 243-247
Environments, evaluating primitive procedure calls      131 139
Environments, initial environment      124-125 141 204-206
Environments, meaning of define within      127-129
eof-object? (primitive)      267 (E 16.16)
eq? (primitive)      91
equal? (primitive)      96
Equality of objects      91 95-96
eqv? (primitive)      96
error (special form)      62-63 212 16.12)
error messages      8
Error messages, making custom versions with error      62
Error messages, reading carefully      62
Error messages, responding to with equanimity      12
eval (primitive)      244-247 263
Evaluation rules      8 17 27
Evaluation rules, for booleans      33
Evaluation rules, for compound procedure calls      23-24 139
Evaluation rules, for expressions beginning with special forms      20-21 139
Evaluation rules, for numbers      17
Evaluation rules, for primitive procedure calls      18-19 131
Evaluation rules, for symbols      21 127-129
Evaluation rules, model for recursion      45-46
even-or-odd-faotorial      60
even? (primitive)      39 (E 4.10)
exit (primitive)      14
Expert Systems      111 215
Expressions (Scheme)      8
Expressions (Scheme), evaluation of      see evaluation rules
expt      47 59
expt (primitive)      18
expt-maker      159
extend-dictionary      220
fact-helper      51 104 212
Factor      284
Factorial      41-46 104-106 109 134-136 144 207-208 212
factorial-A      51
factorial-B      51 136
Factorizing numbers      55 (E 5.4)
familiar-number      55 (E 5.5) 284
Fencepost errors      60
Files, saving and retrieving from Edwin      14 277-278
Files, saving and retrieving from within programs      255-258
Filter      167 (E 12.5) 289
filter-out-symbol      98 (E 8.11) 285
final-day      291
final-loop      78 (E 7.3)
find-biggest-y-value-of      165
find-dictionaries      233
find-maximum-value      152
first      166 (E 12.1)
First classness      3 147-148
first-element      117 166
five-card-stud-dealer      169 (E 12.14)
float-modulo      197 (E 13.16)
float? (primitive)      39 (E 4.10)
floor (primitive)      27
follow-path      170 (E 12.16)
for-each (primitive)      154
FORTRAN      3
Forward chaining      231-232 237
fragment-of?      113
Frames (in environment diagrams)      126-127
function-applied-n-times      162
function-applied-twice      162
g-edwin      70
Garbage collection      134 157
get-coded-letter      290
get-context      119
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте