Rethinking compilers with live coding
summary
Claim: a textbook, batch compiler fails for live coding so replace repeated tree walks with a dependency graph that reuses prior results; implementation builds and hashes immutable nodes and caches evaluated nodes so only changed parts re-evaluate. Demo system (Gamma) is written in F# with Fable and shows image blurs taking seconds initially but subsequent edits update in under a second, accepts incomplete syntax while preserving prior values, and the approach proves practical.
AI-written summary · about
chapters (11)
- 0:00Start
- 0:32Life Coding
- 8:57Behind the Scenes
- 12:02Textbook Compiler
- 12:55Textbook Compilers
- 16:20Live Coding Environment for Demo
- 16:35Programming Language
- 42:08Summary
- 43:16Fable Compiler
- 44:59How the Cache Invalidation Is Done
- 45:09How Is the Cache Invalidation Done
related talks
32mCompilers: The Next Frontier in Web Performance
28mCompilers: The New Frontier In Web Performance
44mFunctional Array Funhouse Intensive - Part 5 of 5
28mLa nouvelle vague
59mClosing Keynote
47mFunctional Array Funhouse Intensive - Part 4 of 5
32mBuilding a High Performance JavaScript Compiler
02h 50mFunctional Array Funhouse Intensive - Part 3 of 5