"Outperforming Imperative with Pure Functional Languages" by Richard Feldman
Strange Loop Conference · 6 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
Richard Feldman explains how pure functional languages can match or beat imperative ones on performance. Compilers can turn immutable code into in-place mutation, avoiding naive copying. The talk draws on his work on the Roc language.
Why HN recommends it: Recommended as the clearest explanation of why immutable data need not be slow, and as the introduction to Roc.
“As a starting point for those nitty grittys, this talk is probably as good as any” Read on HN ↗