Comments by "MrAbrazildo" (@MrAbrazildo) on "Haskell Is Faster Than C | Prime Reacts" video.

  1. 5:57, performance uses to work in opposite way: the more promiscuity between types the better. And C is specialized on that. 6:46, if the C compiler doesn't receive optimization flags (or -O0), it will pretty much execute line after line. But all flags for that manage execution at better moments. 8:50, as long as I heard, this purity means its f()s don't have side effects. But this is ideal world. In practice, you'll have to write side effects out of f()s (to keep them "pure"), which looses even the precary encapsulation FP offers. It seems to me that only needs a more complex project to see this falling badly, compared to usual FP, in the same way that FP does compared to OO. No wonder why Haskell has the motto: "Fail at all costs!" . 12:00, that's why C++ was created, which seems to me to be the best language for crafting tools. I don't know in depth other languages, but I saw a presentation showing C++ as "the language with more functionality" (compared to D, Rust, Java/C#). So 1 can go much longer than linked lists - and in a safe way, if he creates his tools properly . 20:13, in C the type volatile were used to deal with that. But since 2011 C++ has a STL lib that forbids data race at compile time. It's not as easy to use as higher level languages, but it's a pretty improvement over ancient C-volatile approach.
    1