THE VIDEO SHELF · functional language performance
"Outperforming Imperative with Pure Functional Languages" by Richard Feldman
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 readers recommended it
Recommended as the clearest explanation of why immutable data need not be slow, and as the introduction to Roc.
This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.
Video & recommendation details
- Creator / channel
- Strange Loop Conference
- Topic
- functional language performance
- Format
- talk
- Level
- intermediate
- HN recommenders in dataset
- 6
- HN mentions in dataset
- 8
- Recommendation years in dataset
- 2021–2025
These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.
From the original HN conversations
Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.
> How would one optimize for immutability in this case, other than turning it back into mutability behind the scenes? Roc-lang, which is a functional, systems language in development uses something called opportunistic in-place mutation to do just that. Here's a video where the creator …
memco on Hacker News · 2021-11
In 4x Smaller, 50x FasterThis talk by Richard Feldman about Roc (a new language) goed into why immutable does not necessarily mean slow and given enough attention can mean higher performance in certain cases: [VIDEO]
niels_bom on Hacker News · 2021-11
In 4x Smaller, 50x FasterMaybe [LINK] ? It's not production ready, I just saw nice talk by Richard Feldman [1] about it and it's inspired by Elm. [1] [VIDEO]
aquadrop on Hacker News · 2022-02
In Haskell2020 Is Dead, but All Hope Is Not Lost (2019)
Summaries, classifications and recommendation records are from the HackerTube source dataset. Read about this library and its limitations.