Structure and Interpretation of Computer Programs, 2ed

Chapter 1 - Building Abstractions with Procedures

1. The Elements of Programming

3 5 7 8

2. Procedures and the Processes They Generate

10 12 15 16 17 18 19(linear algebra) 21 22 23 24 25 26 27 28

3. Formulating Abstractions with Higher-Order Procedures

29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

Chapter 2 - Building Abstractions with Data

1. Introduction to Data Abstraction

1 2 3 4 5 6 7 8 9 10 11 12 13 16

2. Hierarchical Data and the Closure Property

17 18 19 20 21 23 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

3. Symbolic Data

53 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71

4. Multiple Representations for Abstract Data

73 74 75 76

5. Systems with Generic Operations

78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97

Chapter 3 - Modularity, Objects, and State

1. Assignment and Local State

1 2 3 4 5 6 7 8

2. The Environment Model of Evaluation

3. Modeling with Mutable Data

16 17 18 19(later) 21 22 23 24 25 28 29 30 33 35 37

4. Concurrency

38 47 48

5. Streams

50 51 52 53 54 55 56 58 59 60 61 62 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82

Chapter 4 - Metalinguistic Abstraction

1. The Metacircular Evaluator

1 2 3 4 5 6 7 8 9 11 12 15 16 17 18 20 21 22

2. Variations on a Scheme — Lazy Evaluation

31 33

3. Variations on a Scheme — Nondeterministic Computing

35 36 39 40 41 42 43 44 50 51 52 54

4. Logic Programming

55 56 57 58 59 60 61 62 63

Chapter 5 - Computing with Register Machines

1. Designing Register Machines

2 3 4 5 8 9 10 11 12 13 15 16 18

Problem Set

Procedures, procedures, procedures!

procedures