6.001 Fall Term 1997 - Lecture Notes

• Lecture #1, Sept 4 - Overview of 6.001
• Lecture #2, Sept 9 - Scheming Recursively (postscript), latex source.
• Lecture #3, Sept 11 - More Recursion, Counting Operations, Scope (postscript)
• Lecture #4, Sept 16 - Substitution Model, Counting Space, Iterative Processes (postscript)
• Lecture #5, Sept 18 - Higher-Order Procedures (postscript)
• Lecture #6, Sept 23 - Compound Data (postscript)
• Lecture #7, Sept 25 - Lists and Trees (postscript)
• Lecture #8, Sept 30 - List and Tree Abstractions (postscript)
• Lecture #9, Oct 2 - Abstract Syntax (postscript)
• Lecture #10, Oct 7 - Representing Sets (postscript)
• Lecture #11, Oct 9 - Pattern Matching (postscript)
• Lecture #12, Oct 14 - Generic Operations (postscript)
• Lecture #13, Oct 16 - Environment Model (postscript)
• Lecture #14, Oct 21 - Assignment (set!) and State (postscript)
• Lecture #15, Oct 23 - Mutation and Data Structures(postscript)
• Lecture #16, Oct 28 - Streams(postscript)
• Lecture #17, Oct 30 - Object Oriented Programming (postscript)
• Lecture #18, Nov 4 - Scheme, the Web, and Public Policy
  
• Lecture #19, Nov 6 - Implementing Objects with Message Passing (postscript)
• Lecture #20, Nov 13 - Scheme Evaluators (lecture notes)
• Lecture #21, Nov 18 - Variations on a Scheme (postscript)
• Lecture #22, Nov 20 - First-order Tail-recursive Interpreter
• Lecture #23, Nov 24 - Machine Architecture (postscript)
• Lecture #24, Dec 2 - Machine Architecture - Revised final sections (postscript)
• Lecture #25, Dec 4 - Scheme Reader: Index
• Lecture #26, Dec 9 - Limitations of Scheme (postscript), Notes on the Halting Problem (ps)