Catalog

Structure and Interpretation of Computer Programs

Electrical Engineering and Computer Science MIT CC BY-NC-SA 4.0 20 lectures

This course introduces students to the principles of computation. Upon completion of 6.001, students should be able to explain and apply the basic methods from programming languages to analyze computational systems, and to generate computational solutions to abstract problems. Substantial weekly programming assignments are an integral part of the course. This course is worth 4 Engineering Design Points.

Syllabus

  1. 1 1A: Overview and Introduction to Lisp
  2. 2 1B: Procedures and Processes; Substitution Model
  3. 3 2A: Higher-order Procedures
  4. 4 2B: Compound Data
  5. 5 3A: Henderson Escher Example
  6. 6 3B: Symbolic Differentiation; Quotation
  7. 7 4A: Pattern Matching and Rule-based Substitution
  8. 8 4B: Generic Operators
  9. 9 5A: Assignment, State, and Side-effects
  10. 10 5B: Computational Objects
  11. 11 6A: Streams, Part 1
  12. 12 6B: Streams, Part 2
  13. 13 7A: Metacircular Evaluator, Part 1
  14. 14 7B: Metacircular Evaluator, Part 2
  15. 15 8A: Logic Programming, Part 1
  16. 16 8B: Logic Programming, Part 2
  17. 17 9A: Register Machines
  18. 18 9B: Explicit-control Evaluator
  19. 19 10A: Compilation
  20. 20 10B: Storage Allocation and Garbage Collection

Course materials