Concrete Functional Programming

on YouTube ↗36m

" summary

Argues that functional languages win when the runtime and data structures are concrete: shows a generational Cheney copying GC that makes short-lived allocation effectively free and cites a paper where biased reference counting costs ~30% runtime, gives a JVM example where young-gen collection is 1–2 ms; demonstrates array/APL-style primitives and a 64-ary RB persistent vector trie for O(log n) updates; describes KamilaLisp prototypes (symbolic Jacobian, tiling window manager in Java Swing) and four rewrites over five years.

AI-written summary · about

" chapters (7)

1. 0:00Introduction
2. 3:04Garbage collection
3. 10:48The power of APL
4. 19:13Immutability and linear types
5. 23:15Persistent data structures
6. 30:37Compiler optimizations
7. 32:29KamilaLisp and conclusion

" related talks

• 44mFunctional Programming You Already KnowKevlin Henney · Codemotion Rome 2015
• 01h 44mFunctional Programming: Technical Reasons to AdaptVenkat Subramaniam · JavaDay Kyiv 2015
• 58mKeynote: Why Functional Programming MattersJohn Hughes, Mary Sheeran · Code Mesh 2015
• 01h 06mThe Joy of Functional ProgrammingVenkat Subramaniam · Functional Conf 2014
• 49m“Applying functional programming in code design"Michał Dominiak · CppCon 2015
• 57mThe Fun of Functional Programming PanelJohn A De Goes, Bill Venners, Julie Pitt, Dick Wall, Michael Pilquist, Stew O'Connor · Scale By the Bay 2017
• 32mFunctional Programming in 40 MinutesRuss Olsen · GOTO Copenhagen 2024
• 01h 04mFunctional C++ For Fun And ProfitPhil Nash · ACCU 2017