Earlier quoted context omitted.
>Sure, but how much slower is Haskell than an equivalent implementation in C? Some quick searching suggests numbers like 1000% slower... With things like stream fusion ( http://research.microsoft.com/en-us/um/people/simonpj/papers... ) , which I imagine would capture a lot of crypto calls, GHC can generate some very performant code (paper contains examples of hand-written C code being beat by Haskell code, and the C…
That paper is extremely fascinating, thanks for sharing. As an aside, I'm reasonably sure that GCC can use SIMD instructions for certain bulk memory operations in certain circumstances if you feed it the right -march= parameters... I don't think it's as clever as the techniques in this paper, however.
A lot of Haskell stuff is based around its lazy evaluation model though