Structure and Interpretation of Computer Programs, second editionStructure and Interpretation of Computer Programs has had a dramatic impact on computer science curricula over the past decade. This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard. |
Contents
Building Abstractions with Procedures | 1 |
Building Abstractions with Data | 79 |
Modularity Objects and State | 217 |
Metalinguistic Abstraction | 359 |
Computing with Register Machines | 491 |
| 611 | |
| 619 | |
Other editions - View all
Structure and Interpretation of Computer Programs, second edition Harold Abelson,Gerald Jay Sussman No preview available - 1996 |
Common terms and phrases
abstraction amount apply arguments assign balance base begin binding body branch called combination compiler complex compound cond cons consider construct contains continue controller create define definition delay described elements environment error evaluator example execution Exercise expression factorial false Figure frame function given goto guess idea implement input instruction integers interpreter iterative label lambda language linkage Lisp machine match means method modify object operands operations painter pair pattern perform polynomial predicate primitive problem proc procedure produce query recursive represent representation result returns rule Scheme sequence shows simple specified square stack steps stream structure symbol takes tion tree true variable write