Do Programming Language Features Deliver on their Promises
summary
A full compiler is implemented in a points‑free style and turns out harder to read and prone to duplicated logic so the points‑free compiler experiment works but increases cognitive load; a comparison shows a 17‑line compiler versus a nanopass thousand‑line version and a larger project that becomes 1500‑line instead of an expected 50–100k lines; a static‑analysis effort targets real codebases (about 5 million lines of APL) and proves feasible because APL is “statically dynamic.”
AI-written summary · about
chapters (11)
- 0:00Programming language promises
- 3:11Simple vs complex design
- 6:02Points-free programming pitfalls
- 13:09Hidden costs of DSLs
- 20:10Reflection in dynamic languages
- 25:09Garbage collection examined
- 30:04Control flow complexity
- 36:51Static typing trade-offs
- 42:52Formal methods future
- 45:39Scaling code complexity
- 46:44Q&A
related talks
55mHow bad is meta-programming still today?
01h 03mto pass and return, the story of functions, values and compilers
56mPractical C++17
01h 00mJust-in-Time Compilation
01h 50mUnderstanding Compiler Optimization
01h 01mThree Unlikely Successful Features of D
37mA (Not So Gentle) Introduction To Systems Programming In ATS
01h 04mWhat Can Compiler Benchmarks Reveal About Metaprogramming Implementation Strategies
