How close can pure functional programming get to C?
stmonty
36 points
2 comments
October 24, 2026
Related Discussions
Found 5 related stories in 124.1ms across 10,409 title embeddings via pgvector HNSW
- International Conference on Functional Programming (ICFP) 2026 talks released matt_d · 25 pts · September 22, 2026 · 52% similar
- C*: Unifying Programming and Verification in C (2025) rramadass · 76 pts · September 08, 2026 · 48% similar
- I thought I was building a C replacement. I was wrong birdculture · 17 pts · September 29, 2026 · 46% similar
- The future of programming (1982) vismit2000 · 62 pts · October 17, 2026 · 45% similar
- A few good ideas in programming languages airhangerf15 · 89 pts · September 12, 2026 · 45% similar
Discussion Highlights (2 comments)
eigenblake
I'm very simple. I see Richard Feldman post. I like it. I'll leave it to the experts as to whether this is a case of opportunistic mutation .
jandrewrogers
Much of the difference in optimizability is that C/C++ allows you to do fairly extreme copy elision. This is important because memory bandwidth tends to be a major performance bottleneck. C/C++ code can trivially reach into some remote bit of state and mutate it directly. The compiler rarely objects, no matter how ugly the access method or pattern. It is up to the programmer to make sure the invariants hold and the compiler can’t always see through it. These elided copies add up, though it usually has a maintainability and safety cost. It is related to why functional languages tend to be mediocre for supercomputing in practice despite having nice properties for massive parallelism in theory.