Structure and Interpretation of Computer Programs, second editionMIT Press, 25. júl. 1996 - 574 síður Structure 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. |
Efni
Building Abstractions with Procedures | 1 |
Formulating Abstractions with HigherOrder Procedures | 56 |
Building Abstractions with Data | 79 |
Modularity Objects and State | 217 |
Metalinguistic Abstraction | 359 |
Computing with Register Machines | 491 |
| 611 | |
| 619 | |
Aðrar útgáfur - View all
Structure and Interpretation of Computer Programs, second edition Harold Abelson,Gerald Jay Sussman Takmarkað sýnishorn - 1996 |
Common terms and phrases
algorithm Alyssa ambeval append apply arg1 arguments assign val balance Ben Bitdiddle binding Bitdiddle branch label called car and cdr combination compiler complex numbers compound cond connector cons cons-stream const construct data objects data structures define definition elements environment eval evaluator example execution procedure Exercise expression factorial Fibonacci Figure frame function goto label goto reg guess implement input integers interpreter iterative lambda lazy evaluation linkage Lisp logic programming loop memoized modify mutex Newton's method normal-order null number of steps operands operations painter pair pattern pattern variables perform polynomial predicate produce programming language query queue rational numbers recursive reg proc reg val register machine represent representation result returns rule Scheme selectors set-cdr simulator specified sqrt square stack stream stream-cdr symbol tail recursion test-and-set tion tree variable