How Pure Functional Languages Can Match Imperative Performance
Strange Loop Conference · Talk · YouTube title: "Outperforming Imperative with Pure Functional Languages" by Richard Feldman
Why it's here
Recommended as the clearest explanation of why immutable data need not be slow, and as the introduction to Roc.
What it covers
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.