All three are problems with performance on a von Neumann machine. So there are three main reasons why Haskell is not a great language for expressing <i>high-performance computation</i> algorithms. Since CS is a branch of maths, performance isn&#x27;t that big a deal; the important thing is that the result is computable. The performance may be an interesting property, but so is line count and purity and ease of writing proofs and doing analysis on the code!<p>Speaking more pragmatically, outside of CS study, most of the programs I write do not require me to write high-performance algorithms – they tend to be very I&#x2F;O bound, and call out to external libraries&#x2F;services for the data crunching. When I need performance (because of course I do at times), there is an amazing library that lets me write C code in Haskell[1]. The fact that some sections of my program is performance critical doesn&#x27;t mean I have to write the entire program in C. I can write just the performance critical parts in C.<p>[1]: <a href="https:&#x2F;&#x2F;github.com&#x2F;fpco&#x2F;inline-c&#x2F;blob&#x2F;master&#x2F;README.md" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;fpco&#x2F;inline-c&#x2F;blob&#x2F;master&#x2F;README.md</a>