**Structure and Interpretation of Computer Programs**

by Harold Abelson, Gerald Jay Sussman, Julie Sussman

**Publisher**: McGraw-Hill 1996**ISBN/ASIN**: 0262011530**ISBN-13**: 9780262011532**Number of pages**: 588

**Description**:

Abelson and Sussman's classic Structure and Interpretation of Computer Programs teaches readers how to program by employing the tools of abstraction and modularity. The authors' central philosophy is that programming is the task of breaking large problems into small ones. The book spends a great deal of time considering both this decomposition and the process of knitting the smaller pieces back together.

Download or read it online for free here:

**Read online**

(online html)

## Similar books

**Programming Languages: Application and Interpretation**

by

**Shriram Krishnamurthi**-

**Lulu.com**

The textbook for a programming languages course, taken primarily by advanced undergraduate and beginning graduate students. This book assumes that students have modest mathematical maturity, and are familiar with the existence of the Halting Problem.

(

**12173**views)

**Elements of Programming**

by

**Alexander Stepanov, Paul McJones**-

**Semigroup Press**

This book applies the deductive method to programming by affiliating programs with the abstract mathematical theories. Specification of these theories, algorithms and theorems and lemmas describing their properties are presented together.

(

**5150**views)

**Exploring Programming Language Architecture in Perl**

by

**Bill Hails**

This book presents an informal and friendly introduction to some of the core ideas in modern computer science, using the programming language Perl as its vehicle. The book takes the form of a series of working interpreters for the language PScheme.

(

**15353**views)

**The Theory of Languages and Computation**

by

**Jean Gallier, Andrew Hicks**-

**University of Pennsylvania**

From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.

(

**8235**views)