HackerTubewatch
Surprise me
Frame from Lecture 7A | MIT 6.001 Structure and Interpretation, 1986 Plays via YouTube's privacy-enhanced embed

Lecture 7A | MIT 6.001 Structure and Interpretation, 1986

17 videos recommended on HN
YouTube
Cited on HN 3 times, 2013–2019, never outright recommended score 0
Years with an HN recommendation, 2007–2026

HN commenters cite it as the classic explanation of eval and the meta-circular evaluator.

Lecture 7A of the 1986 MIT 6.001 SICP course, with Gerald Sussman presenting the metacircular evaluator, part 1. It shows how a Lisp evaluator can be written in Lisp itself.

“thanks to this classic video of Sussman” (HN, 2018)

3 citations · Lectures · intermediate

3 Hacker News comments

From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.

@Garoof Apr 2013 Cites it
on HN thread _why's complete printer spool as one book [pdf]
Read more
(I like _why and I don't have any problem with the attention he receives or anything. But I did kind of agree with some of the "that's rubbish" responses to the "first" stuff.) I'm reasonably sure I won't agree with you on any definition of art. But, uh, here's some stuff. I may-or-may-not think of some of it as art. I do think it's stuff that keeps the coding world from being some dreadful place of "craftsmanship" and "professionalism" and things. The miniKanren presentations are wonderful. They're all "and now let's run this stuff backwards. Because because." [link] Meta-circular evaluators. Page 13 of [link] [this video] [link] ("After completing the preceding exercise, use the interpreter to run a copy of the interpreter, and use the copy to run another copy of the interpreter. Repeat this process to see how many levels deep it will go before the system grinds to a halt." :D) SICP opens with this: [link] I think it's lovely. [link] "One of Dijkstra's sidelines was serving as Chairman of the Board of the fictional Mathematics Inc., a company that he imagined having commercialized the production of mathematical theorems in the same way that software companies had commercialized the production of computer programs. He invented a number of activities and challenges of Mathematics Inc. and documented them in several papers in the EWD series." Also obfuscated code and some esolang stuff, I guess. I remember some competition that was about creating and hiding some bug that did some p
Lecture on meta-circular evaluators cited among examples of playful coding.
@mtreis86 Oct 2018 Cites it
on HN thread Ask HN: What's your favorite elegant/beautiful algorithm?
My favorite is the FLAC algorithm. It's fairly simple to explain - take a signal input, pattern match a generative signal that closely matches the original or part of it, and the output is a combination of that generative code and the difference between it and it and the input. Second favorite is the LISP REPL. Specifically the Eval function, thanks to this classic video of Sussman [this video]
Sussman explaining the Lisp eval function.
@olooney Jun 2019 Cites it
on HN thread Computer Science vs. Computing Science (1999)
Read more
The self-definition comment is a reference to the common LISP exercise of writing a "meta-circular evaluator"[1] - that is, writing a LISP interpreter in LISP. This is famously done[3] in "Structure and Interpretation of Computer Programs", which is a very popular textbook and MIT course which uses LISP as a teaching language[2]. This can be found for example, in lecture 7 of the SICP lecture series on Youtube[4]. Dijkstra's comment on this is quite acerbic, isn't it? Here is the full quote for easy reference: > [LISP's] promotion of the idea that a programming language should be able to formulate its own interpreter (which then could be used as the language’s definition) has caused a lot of confusion because the incestuous idea of self-definition was fundamentally flawed. I agree to the extent that the exercise of writing a LISP interpreter in LISP is indeed often a very confusing exercise for beginner, partly because writing any interpreter (or compiler) is fairly arcane for a beginner, and partly because keeping track of which parts are in implementation and which parts are in the target language can be made more difficult; also because it's easy to "cheat" and rely on outside language in inappropriate ways. I would recommend using a language you already know well and implementing a moderately simple language as a first exercise to a student. But on the whole the exercise of writing an interpreter in its own language - or alternatively writing a self-hosting compiler[5] -
SICP lecture 7 covers the meta-circular evaluator.

Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.

Keyboard shortcuts

/
Search
j k
Next / previous video
r
Surprise me
l
Like (video page)
w
Watch later (video page)
?
This help
Esc
Close