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.
Structure and Interpretation of Computer Programs
Massachusetts Institute of Technology via MIT OpenCourseWare
Overview
Syllabus
- 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
Taught by
Prof. Trevor Darrell, Prof. Eric Grimson, and Prof. Peter Szolovits
