Content deleted Content added
Add isbn Tags: Mobile edit Mobile web edit Advanced mobile edit |
Altered journal. Add: authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this tool. Report bugs. | #UCB_Gadget |
||
(11 intermediate revisions by 7 users not shown) | |||
Line 3:
{{Infobox book
| italic title = force
| name = Structure and Interpretation of Computer Programs (SICP)
| image = SICP cover.jpg
| caption = Cover of the second edition
| author = [[Harold Abelson]], [[Gerald Jay Sussman]], Julie Sussman
| cover_artist =
| country =
| series =
| subject = [[Computer science]]
| genre = [[Textbook]]
| publisher = [[MIT Press]]
| pub_date = 1984 (1st ed.), 1996 (2nd ed.), 2022 ([[Structure and Interpretation of Computer Programs, JavaScript Edition|JavaScript ed.]])
| media_type =
| pages = 657
| isbn = 0-262-51087-1
| isbn_note = (2nd ed.)
| oclc =
| dewey =
| congress = QA76.6 .A255 1996
| website = {{URL|mitpress.mit.edu/sicp}}
}}
'''''Structure and Interpretation of Computer Programs''''' ('''''SICP''''') is a [[computer science]] textbook by [[Massachusetts Institute of Technology]] professors [[Harold Abelson]] and [[Gerald Jay Sussman]] with Julie Sussman. It is known as the "Wizard Book" in [[hacker culture]].<ref>{{Cite book |
[[MIT Press]] published the first edition in 1984, and the second edition in 1996. It was
MIT Press published
== Content ==
Line 36:
=== Chapter 1: Building [[Abstraction (computer science)|Abstractions]] with [[Function (computer programming)|Procedures]] ===
▲# The Elements of Programming
▲# Procedures and the [[Process (computing)|Processes]] They Generate
▲# Formulating Abstractions with Higher-Order Procedures
=== Chapter 2: Building Abstractions with [[Data]] ===
▲# Introduction to Data Abstraction
# Hierarchical Data and the [[Closure (mathematics)|Closure Property]]
# Symbolic Data
# Multiple Representations for Abstract Data
# Systems with Generic Operations
=== Chapter 3: Modularity, [[Object (computer science)|Objects]], and [[State (computer science)|State]] ===
# [[Assignment (computer science)|Assignment]] and [[Local variable|Local State]]
# The Environment Model of Evaluation
# Modeling with Mutable Data
# [[Concurrency (computer science)|Concurrency]]: Time Is of the Essence
# Streams
=== Chapter 4: [[Metalinguistics|Metalinguistic]] Abstraction ===
Line 64 ⟶ 62:
=== Chapter 5: Computing with [[Register machine|Register Machines]] ===
# Designing [[Register machine|Register Machines]]
# A Register-Machine Simulator
# [[Register allocation|Storage Allocation]] and [[Garbage collection (computer science)|Garbage Collection]]
# The Explicit-Control Evaluator
# Compilation
== Characters ==
Several humorously-named fictional characters appear in the book:
* Alyssa P. Hacker, a Lisp [[hacker]]
* Ben Bitdiddle
Line 76 ⟶ 74:
* [[Evaluator|Eva Lu Ator]]
* Lem E. Tweakit
* Louis Reasoner, a "loose reasoner"
== License ==
Line 86 ⟶ 84:
== Reception ==
''[[Byte (magazine)|Byte]]'' recommended SICP in 1986 "for professional programmers who are really interested in their profession". The magazine said that the book was not easy to read, but that it would expose experienced programmers to both old and new topics.<ref name="kilov198611">{{cite book|url=https://archive.org/details/byte-magazine-1986-11/page/n83/mode/1up|title=Byte Magazine Volume 11 Number 12: Knowledge Representation|date=November 1986|language=English |page=70 |last=Kilov |first=Haim}}</ref>
A review of SICP as an undergraduate textbook by [[Philip Wadler]] noted the weaknesses of the Scheme language as an introductory language for a computer science course.<ref>{{Cite journal |last=Wadler |first=P |date=1987-03-01 |title=A critique of Abelson and Sussman or why calculating is better than scheming |url=https://dl.acm.org/doi/10.1145/24697.24706 |journal= ACM SIGPLAN Notices|volume=22 |issue=3 |pages=83–94 |doi=10.1145/24697.24706 |issn=0362-1340}}</ref> Wadler criticized in particular the lack of [[pattern matching]], obscuring [[equational reasoning]] and making the teaching of proofs harder; the lack of [[Algebraic data type|algebraic data types]] in Scheme and the over-reliance on [[cons]] pairs for both code and data representation, which can confuse beginning students; and the choice of [[Strict evaluation|strict]] instead of [[lazy evaluation]] as the standard evaluation strategy.
== Influence ==
Line 91:
* ''[[Structure and Interpretation of Classical Mechanics]] (SICM)'', another book that uses Scheme as an instructional element, by Gerald Jay Sussman and Jack Wisdom
* ''[[Software Design for Flexibility]]'', by Chris Hanson and Gerald Jay Sussman
* ''[[How to Design Programs]] (HtDP)'', which intends to be a more accessible book for introductory Computer Science, and to address perceived
* ''[[Essentials of Programming Languages]] (EoPL)'', a book for Programming Languages courses
== See also ==
* ''[[Compilers: Principles, Techniques, and Tools]]''{{snd}} also known as ''The Dragon Book''
|