Code for MIT Scheme Course (SICP)

Build

Travis build is taken from: https://github.com/greghendershott/travis-racket

Personal Notes

lukaswoodtli.github.io

Book (SICP)

https://mitpress.mit.edu/sites/default/files/sicp/index.html

Exercises from Book

Solutions for the Exercises

http://community.schemewiki.org/?SICP-Solutions

Implemented exercises

Chapter 1

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

Chapter 2

Exercise	Done	Exercise	Done	Exercise	Done	Exercise	Done
2.1	✓	2.26	✓	2.51	✗	2.76	✗
2.2	✓	2.27	✓	2.52	✗	2.77	✗
2.3	(✓)	2.28	✓	2.53	✓	2.78	✗
2.4	✓	2.29	✓	2.54	✓	2.79	✗
2.5	✗	2.30	✓	2.55	(✓)	2.80	✗
2.6	(✓)	2.31	✓	2.56	✓	2.81	✗
2.7	(✓)	2.32	(✓)	2.57	(✓)	2.82	✗
2.8	(✓)	2.33	✓	2.58	(✓)	2.83	✗
2.9	(✓)	2.34	✓	2.59	✓	2.84	✗
2.10	(✓)	2.35	✓	2.60	✓	2.85	✗
2.11	(✓)	2.36	✓	2.61	(✓)	2.86	✗
2.12	(✓)	2.37	✓	2.62	(✓)	2.87	✗
2.13	✗	2.38	✓	2.63	(✓)	2.88	✗
2.14	✗	2.39	✓	2.64	(✓)	2.89	✗
2.15	✗	2.40	✓	2.65	✗	2.90	✗
2.16	✗	2.41	✗	2.66	✗	2.91	✗
2.17	✓	2.42	✗	2.67	✓	2.92	✗
2.18	✓	2.43	✗	2.68	✓	2.93	✗
2.19	✗	2.44	✓	2.69	✗	2.94	✗
2.20	✓	2.45	✓	2.70	✗	2.95	✗
2.21	✓	2.46	✓	2.71	✗	2.96	✗
2.22	✓	2.47	✓	2.72	✗	2.97	✗
2.23	✓	2.48	✓	2.73	✗
2.24	(✗)	2.49	✓	2.74	✗
2.25	✓	2.50	✗	2.75	✗

Chapter 3

Exercise	Done	Exercise	Done	Exercise	Done	Exercise	Done
3.1	✓	3.22	✗	3.43	✗	3.64	✓
3.2	✓	3.23	✗	3.44	✗	3.65	✓
3.3	✓	3.24	✓	3.45	✗	3.66	✗
3.4	✓	3.25	✗	3.46	✗	3.67	✗
3.5	✗	3.26	✗	3.47	✗	3.68	✗
3.6	✗	3.27	✗	3.48	(✓)	3.69	✗
3.7	✗	3.28	✓	3.49	(✓)	3.70	✗
3.8	(✓)	3.29	✗	3.50	✓	3.71	✗
3.9	✗	3.30	✗	3.51	✓	3.72	✗
3.10	✗	3.31	✗	3.52	✓	3.73
3.11	✗	3.32	✗	3.53	✓	3.74
3.12	✓	3.33	✓	3.54	✓	3.75
3.13	✓	3.34	✓	3.55	✓	3.76
3.14	✓	3.35	✓	3.56	✗	3.77
3.15	✗	3.36	✗	3.57	✗	3.78
3.16	✓	3.37	✓	3.58	✗	3.79
3.17	✓	3.38	✗	3.59	✗	3.80
3.18	✗	3.39	✗	3.60	✗	3.81
3.19	✗	3.40	✗	3.61	✗	3.82
3.20	✓	3.41	✗	3.62	✗
3.21	✗	3.42	✗	3.63	✗

Chapter 4

Exercise	Done	Exercise	Done	Exercise	Done	Exercise	Done
4.1	✗	4.21		4.41		4.61
4.2		4.22		4.42		4.62
4.3		4.23		4.43		4.63
4.4		4.24		4.44		4.64
4.5	✗	4.25		4.45		4.65
4.6		4.26		4.46		4.66
4.7		4.27		4.47		4.67
4.8		4.28		4.48		4.68
4.9	✗	4.29		4.49		4.69
4.10	(✗)	4.30		4.50		4.70
4.11		4.31		4.51		4.71
4.12		4.32		4.52		4.72
4.13		4.33		4.53		4.73
4.14		4.34		4.54		4.74
4.15		4.35		4.55		4.75
4.16		4.36		4.56		4.76
4.17		4.37		4.57		4.77
4.18		4.38		4.58		4.78
4.19		4.39		4.59		4.79
4.20		4.40		4.60

Course Videos

Videos

Lecture	Topic	Done
1A	Overview and Introduction to Lisp	✓
1B	Procedures and Processes; Substitution Model	✓
2A	Higher-order Procedures	✓
2B	Compound Data	✓
3A	Henderson Escher Example	✓
3B	Symbolic Differentiation; Quotation	✓
4A	Pattern Matching and Rule-based Substitution	✓
4B	Generic Operators	✓
5A	Assignment, State, and Side-effects	✓
5B	Computational Objects	✓
6A	Streams, Part 1	✓
6B	Streams, Part 2	✓
7A	Metacircular Evaluator, Part 1	✓
7B	Metacircular Evaluator, Part 2	✓
8A	Logic Programming, Part 1	✓
8B	Logic Programming, Part 2	✓
9A	Register Machines	✓
9B	Explicit-control Evaluator	✓
10A	Compilation
10B	Storage Allocation and Garbage Collection

Slides

Slides

Lecture	Documents	Done
1	lecture1webhand.pdf	✓
2	lecture2lispstor.pdf, lecture2webhand.pdf	✓
3	lecture3webhand.pdf	✓
4	lecture4webhand.pdf	✓
5	lecture5webhand.pdf	✓
6	lecture6webhand.pdf	✓
7	lecture7webhand.pdf	✓
8	lecture8webhand.pdf	✓
9	lecture9webhand.pdf	✓
10	lecture10webhan.pdf	✓
11	lecture11webhan.pdf	✓
12	lecture12webhan.pdf	✓
13	lecture13webhan.pdf	✓
15	lecture15webhan.pdf, lecture15webha2.pdf	✓
16	lecture16webhan.pdf	✓
17	lecture17_webhan.pdf	✓
18	lecture18_webhan.pdf	✓
19	lecture19interco.pdf, lecture19webha2.pdf, lecture19webhan.pdf	✓
20	lecture20evalco.pdf, lecture20webhan.pdf
21	lecture21lazyeva.pdf, lecture21webha2.pdf, lecture21webhan.pdf
22	lecture22webhan.pdf
23	lecture23webhan.pdf
26	lecture26webhan.pdf