Hal Abelson
Professor of Electrical Engineering and Computer Science · MIT · Distinguished · author of Structure and Interpretation of Computer Programs
MIT Professor of Electrical Engineering and Computer Science and co-author of Structure and Interpretation of Computer Programs (SICP).
- lectures
- 26
- series
- 1
- hours
- 28
Start here
- Overview and Introduction to Lisp: Procedural & Symbolic Abstractionfrom Abelson et al., Structure and Interpretation of Computer Programs

- The Henderson Escher Example: Recursive Graphicsfrom Abelson et al., Structure and Interpretation of Computer Programs

- Higher-Order Procedures and Functional Abstractionfrom Abelson et al., Structure and Interpretation of Computer Programs

Series and courses
MIT 6.001: Structure and Interpretation of Computer Programs (SICP)
Open the course
- 1Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
- 2Procedures and Processes: The Substitution Model, Recursion & Iteration
- 3Higher-Order Procedures and Functional Abstraction
- 4Compound Data Structures in Programming
Show 10 moreShow fewer
- 5The Henderson Escher Example: Recursive Graphics
- 6Symbolic Differentiation and Quotation in Lisp
- 8Streams, Part 1
- 10Metacircular Evaluator, Part 1 (1986)
- 11Logic Programming, Part 1
- 12Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
- 14Compilation
- 16Storage Allocation and Garbage Collection
- 18Structure and Interpretation of Computer Programs (SICP): Data Abstraction and Closure
- 20Storage Allocation and Garbage Collection
Talks
- 1Assignment, State, and Side-effects (SICP Lecture 5a)
- 2Generic Operators
- 3Explicit-Control Evaluator
- 4Computational Objects
Show 8 moreShow fewer
- 5Register Machines (SICP Lecture 9a)
- 6Metacircular Evaluator, Part 2
- 7Pattern Matching and Rule-Based Substitution
- 8Logic Programming, Part 2 (SICP Lecture 8b)
- 9Compound Data Structures in SICP
- 10Procedures and Processes; Substitution Model (SICP Lecture 1b)
- 11Henderson Escher Example
- 12Higher-order Procedures (SICP Lecture 2a)
In these lectures
- Computer science is fundamentally about formalizing intuition about process and imperative knowledge, rather than merely studying physical computers.Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
- Data abstraction isolates the use of data objects from their underlying representations.The Henderson Escher Example: Recursive Graphics
- Duplicate code indicates a missed abstraction opportunity; common patterns should be encapsulated into higher-order procedures.Higher-Order Procedures and Functional Abstraction
Draws on
People cited in the lectures, at the moment of the citation.
- Heron of AlexandriaAncient mathematician cited for the square root approximation algorithm by successive averaging.
- Peter HendersonUniversity of Stirling in Scotland, creator of the picture language.
- Chris StracheyComputer scientist, logician, and pioneer of denotational semantics, cited as a proponent of first-class procedures.
- Peter DeutschCited for a modification to the LISP garbage collection algorithm.
- Henry BakerInventor of modifications for real-time garbage collection.
- Georg CantorCited for Cantor's diagonal argument regarding the uncountability of real numbers.
Playlists
2Taught with
Same subject, Computer Systems & Software
Connections
32Their places, courses, books and lectures.
Scholar1
Institution1
Lectures26
- Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
- The Henderson Escher Example: Recursive Graphics
- Higher-Order Procedures and Functional Abstraction
- Compound Data Structures in Programming
- Streams, Part 1
- Assignment, State, and Side-effects (SICP Lecture 5a)
Show 20 moreShow fewer
- Procedures and Processes: The Substitution Model, Recursion & Iteration
- Symbolic Differentiation and Quotation in Lisp
- Metacircular Evaluator, Part 1 (1986)
- Generic Operators
- Explicit-Control Evaluator
- Computational Objects
- Logic Programming, Part 1
- Register Machines (SICP Lecture 9a)
- Metacircular Evaluator, Part 2
- Storage Allocation and Garbage Collection
- Compilation
- Pattern Matching and Rule-Based Substitution
- Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
- Logic Programming, Part 2 (SICP Lecture 8b)
- Compound Data Structures in SICP
- Procedures and Processes; Substitution Model (SICP Lecture 1b)
- Henderson Escher Example
- Higher-order Procedures (SICP Lecture 2a)
- Storage Allocation and Garbage Collection
- Structure and Interpretation of Computer Programs (SICP): Data Abstraction and Closure






