Главная    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
Предметный указатель
Schroeppel, Rich      54 (E 5.4)
screen-region-bottom-y      73
screen-region-left-x      73
select-any-from-list      112-113
select-random-element      288
set! (special form)      174
set-car! (primitive)      177-181 243
set-cdr! (primitive)      177-181 243
set-input-port!      268 (E 16.17)
set-line-length! (primitive)      70 252
set-output-port!      257
set-pen-color! (primitive)      69
set-this-pixel?      74
set-video-mode! (primitive)      70-71 252
Sharing      182-183
shell-volume      29 (E 3.8) 283
Shuffle      99 (E8.16)
simple-wait-helper      285
simple-«ait      285
sin (primitive)      27
sin-maker      170 (E 12.16)
single-row-loop      74 77 258
size-of-file      268 (E 16.16)
slugging-pct      29 (E 3.10) 283
sort-by-rule      153
sort-high-to-low      163
sort-in-alphabetical-order      163
sort-low-to-high      163
Sorting      152-153 163
Special forms, creating new ones with macro      258-261 269-270
Special forms, define as an example of      20-21
Special forms, distinct from Scheme objects      138-139 145-146
Special forms, evaluation of      20-21 139
Special forms, if as an example of      32-33
speeding?      37 (E 4.2)
sphere-volume      29 (E 3.8) 283
splice-nth-cdr!      291
sqrt      50 51 55
sqrt (primitive)      25
sqrt-till-1      48
Square      22 129-130 189 204-207
square-then-double      169 (E 12.15)
Stallman, Richard      271
start-of-next-month      96 (E 8.2)
starting-part?      113
Stoy, Joseph      147n
string->list (primitive)      270 (E 16.21)
string-append (primitive)      270 (E 16.21)
string-fill! (primitive)      202 (E 13.21)
string-length (primitive)      201 (E 13.21)
string-null? (primitive)      270 (E 16.21)
string-oopy (primitive)      270 (E 16.21)
string-ref (primitive)      201 (E 13.21) 270
string-set! (primitive)      201 (E 13.21) 270
string=? (primitive)      101 (E8.24)
string? (primitive)      101 (E8.24) 267
strings      101-102 270
Strings, as mutable objects      200-202 (E 13.21)
Strings, versus symbols      101
subexpressions      19
subprocedures      103-109
substring (primitive)      270 (E 16.21)
substring-fill! (primitive)      202 (E 13.21)
substring-move-left! (primitive)      202 (E 13.21)
substring-move-right! (primitive)      202(E 13.21)
successful-predicates      171 (E 12.18) 290
SUM      87 285
sum-list-A      265 (E 16.12)
sum-list-B      265 (E 16.12)
sum-result-of-functions      166 (E 12.2)
sum-squares-to-O      210
Sussman, Gerald Jay      2n
Sussman, Julie      2n
symbol-values      263-264 (E 16.8)
symbol? (primitive)      94 267
Symbols, allowable formats for      21
Symbols, as Scheme objects      79 90-91
Symbols, bound to objects by define      20 (see also Bindings)
Symbols, case-insensitivity      91
Symbols, evaluation of      21
Symbols, versus strings      101
Tab key, formatting Scheme expressions with      15 (E 2.7) 279
Tail recursion      see recursion
talk-to-turtle      246
tan (primitive)      27
tenth-root      169 (E 12.13)
Test-function      152 157
text-mode      70 252
the-environment (primitive)      244
then-part      234
throw-away      221
time-this-call      167 (E 12.4) 288
timess-two      148-149
toll-free-number?      96 (E 8.1)
Top-level procedures      103-104
trace (primitive)      63-64
trace-both (primitive)      64
trace-exit (primitive)      64
Tracing procedure calls      see trace
Tree recursion      95
triangle-area      28 (E 3.5) 37 284
triangle-area-2      28 (E 3.6) 283
truncate (primitive)      30 (E 3.13)
Truth maintenance systems      237-238
try      221 224 226 236 292
try-all-assertions      221 224
try-depending-on-type      224 225 229
try-strong-cues      116
try-this      254
try-weak-cues      118
Turtle program      184-190 196-199 245-246
type errors      60 62
type-at-environment      246
unbound? (special form)      263 (E 16.6)
unbreak (primitive)      213 (E 13.5)
unbreak-entry (primitive)      213 (E 13.5)
unbreak-exit (primitive)      213 (E 13.5)
Unit-vector      96 (E 8.3)
unless      260 269
untrace (primitive)      64
use-comparison-to-remove-elements      167 (E 12.6)
use-dont-keep-proc      229
user-initial-environment (variable)      244 16.5)
variable-name      220
variable?      219
vector (primitive)      261 (E 16.1)
vector->list (primitive)      261 (E 16.1)
vector-fill! (primitive)      261 (E 16.1)
vector-length (primitive)      243
vector-ref (primitive)      242
vector-set! (primitive)      242
Vectors      241-243 261-263
vertical-segment?      96 (E 8.3)
vote      243
wait      56 (E 5.11) 285
wait-loop      285
want-to-play-again?      270 (E 16.19)
wants-to-end?      119
weak-response-part      118
weekend-day?      154
Weizenbaum, Joseph      111
Who's on First? program      111-121 191
Who's on First? program, implementation of      112-119
Who's on First? program, original routine      112 119 120
whos-on-first      119 191 286
whos-on-first-loop      114-115 286
win-or-lose?      280
window-clear (primitive)      250
window-delete (primitive)      250
window-popup (primitive)      264 (E 16.11)
window-popup-delete (primitive)      264 (E 16.11)
window-set-position! (primitive)      249
window-set-size! (primitive)      249
Windows (in PC Scheme)      70-72 247-252 16.9-16.11)
Winston, Patrick Henry      215n
wrap-it-up      119
write (primitive)      256-257 267
write-letter      176-177
writeln (primitive)      48
wrong-args      58
x-coord      141 (E 11.6)
x-coordinate      81
y-coord      141 (E 11.6)
y-coordinate      81
Year      82
yes-or-no      292
zero? (primitive)      39 (E 4.10)
\price-of-meal      99 (E 8.12)
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте