Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs

4.44 (3,435 ratings by Goodreads)
By (author)  , By (author)  , By (author) 

List price: US$86.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

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.
show more

Product details

  • Hardback | 683 pages
  • 155 x 235 x 35mm | 1,044g
  • MIT Press
  • Cambridge, Mass., United States
  • English
  • Revised
  • 2nd Revised edition
  • references, index
  • 0262011530
  • 9780262011532
  • 1,138,926

Table of contents

Part 1 Building abstractions with procedures: the elements of programming; expressions; naming and the environment; evaluating combinations; compound procedures; the substitution model for procedure application; conditional expressions and predicates; example: square roots by Newton's method; procedures as black-box abstractions; procedure and the processes they generate; linear recursion and iteration; tree recursion; orders of growth; exponentiation; greatest common divisors; example: testing primality; formulating abstractions with higher-order procedures; procedures as arguments; constructing procedures using Lambda; procedures as general methods; procedures as returned values. Part 2 Building abstractions with data: introduction to data abstraction; example: arithmetic operations for rational numbers; abstraction barriers; what is meant by data? extended exercise: interval arithmetic; hierarchical data and the closure property; representing sequences; hierarchical structures; sequences as conventional interfaces; example: a picture language; symbolic data; quotation; example: symbolic differentiation; example: representing sets; example: Huffman encoding trees; multiple representations for abstract data; representations for complex numbers; tagged data; data-directed programming and additivity; systems with generic operations; generic arithmetic operations; combining data of different types; example: symbolic algebra. Part 3 Modularity, objects, and state: assignment and local state; local state variables; the benefits of introducing assignment; the costs of introducing assignment; the environment model of evaluation; the rules for evaluation; applying simple procedures; frames as the repository of local state; internal definitions; modelling with mutable data; mutable list structure; representing queues; representing tables; a simulator for digital circuits; propagation of constraints; concurrency: time is of the essence; the nature of time in concurrent systems; mechanisms for controlling concurrency; streams; streams are delayed lists; infinite streams; exploiting the stream paradigm; streams and delayed evaluation; modularity of functional programs and modularity of objects. Part 4 Metalinguistic abstraction: the metacircular evaluator; the core of the evaluator; representing expressions; evaluator data structures; running the evaluator as a program; data as programs; internal definitions; separating syntactic analysis from execution; variations on a scheme - lazy evaluation; normal order and applicative order; an interpreter with lazy evaluation; streams as lazy lists. (Part contents).
show more

About Harold Abelson

Hal Abelson is Class of 1922 Professor of Computer Science and Engineering at Massachusetts Institute of Technology and a fellow of the IEEE. He is a founding director of Creative Commons, Public Knowledge, and the Free Software Foundation. Additionally, he serves as co-chair for the MIT Council on Educational Technology. Gerald Jay Sussman is the Matsushita Professor of Electrical Engineering in the Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. He is also the coauthor of Structure and Interpretation of Computer Programs (MIT Press, second edition, 1996).
show more

Rating details

3,435 ratings
4.44 out of 5 stars
5 63% (2,175)
4 23% (801)
3 10% (331)
2 2% (85)
1 1% (43)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X