Structure and Interpretation of Computer Programs Solutions

Here are my partial solutions to SICP exercises. There are more to come. They have been tested with mit-scheme.

Recommended SICP Scheme Setup

The book uses MIT-Scheme and these solutions are written in the dialect for compatibility. Unfortunately, plain vanilla MIT-Scheme is a pain to use because it omits expected features of a modern REPL such as: tab completion, command history, GNU/emacs key bindings, and has sparse documentation.

For most early problems in the book other versions of scheme will have minimal compatibility problems. I recommend using Biwa Schema which is available on repl.it. For the later problems, I recommend using mit-scheme in conjunction with rlwrap to mitigate most of the annoyances.

Setting up MIT-Scheme

• sudo apt-get install mit-scheme
• Install rlwrap (optional):
  • sudo apt install rlwrap
  • Download a list of standard scheme functions for tab-completion support
  • Start the REPL by running rlwrap -r -c -f mit-scheme-bindings.txt scheme

Basic MIT-Scheme Usage

• Load a file by either running scheme --load file1.txt file2.txt when launching the REPL or executing (load "file1.txt") at the REPL prompt.
• If you miss-type a command, run (restart 1). Ex:

  1 ]=> (does-not-exist)
  
  ;Unbound variable: does-not-exist
  ;To continue, call RESTART with an option number:
  ; (RESTART 3) => Specify a value to use instead of does-not-exist.
  ; (RESTART 2) => Define does-not-exist to a given value.
  ; (RESTART 1) => Return to read-eval-print level 1.
  
  2 error> (restart 1)
  
  ;Abort!
  
  1 ]=>
  

Chapter 1: Building Abstractions with Procedures

• 1.1
• 1.2
• 1.3
• 1.4
• 1.5
• 1.6
• 1.7
• 1.8
• 1.9
• 1.10
• 1.11
• 1.12
• 1.13
• 1.15
• 1.16
• 1.17
• 1.18
• 1.19
• 1.20
• 1.21
• 1.22
• 1.23
• 1.24
• 1.25
• 1.26
• 1.27
• 1.28
• 1.29
• 1.30
• 1.31
• 1.32
• 1.33
• 1.34
• 1.35
• 1.36
• 1.37
• 1.38
• 1.39
• 1.40
• 1.41
• 1.42
• 1.43
• 1.44
• 1.45
• 1.46

Chapter 2: Building Abstractions with Data

• 2.1
• 2.2
• 2.3
• 2.4
• 2.5
• 2.6
• 2.7
• 2.8
• 2.9
• 2.10
• 2.11
• 2.12
• 2.13
• 2.17
• 2.18
• 2.19
• 2.20
• 2.21
• 2.22
• 2.23
• 2.24
• 2.24a
• 2.24b
• 2.25
• 2.26
• 2.27
• 2.28
• 2.29
• 2.30
• 2.31
• 2.32
• 2.33
• 2.34
• 2.35
• 2.36
• 2.37
• 2.38
• 2.39
• 2.40
• 2.41
• 2.42

Chapter 3: Modularity, Objects, and State

• 3.1
• 3.2
• 3.3
• 3.4
• 3.5
• 3.6
• 3.7
• 3.8
• 3.9
• 3.10
• 3.11
• 3.12
• 3.12
• 3.13
• 3.13
• 3.14
• 3.14
• 3.15
• 3.16
• 3.16
• 3.17
• 3.18
• 3.19
• 3.21
• 3.22
• 3.23
• 3.24
• 3.25
• 3.26
• 3.27
• 3.28
• 3.29
• 3.30
• 3.31
• 3.32
• 3.33
• 3.34
• 3.35
• 3.37
• 3.38
• 3.39
• 3.40
• 3.41
• 3.42
• 3.43
• 3.44
• 3.45
• 3.46
• 3.50
• 3.51
• 3.52
• 3.53
• 3.54
• 3.55
• 3.56
• 3.57
• 3.58
• 3.59
• 3.60
• queue
• table
• digital-circuits
• sample-digital-circuit-simulation
• constraints
• temperature-conversion
• streams

Chapter 4: Metalinguistic Abstraction

• 4.1
• 4.2
• 4.3
• 4.4
• evaluator