> Note that there is no theoretical bound preventing an Haskell compiler to generate code equally fast than the one of a C compiler for any program. And there'

> Note that there is no theoretical bound preventing an Haskell compiler to generate code equally fast than the one of a C compiler for any program. And there's no theoretical bound saying that C is faster than Brainfuck. But no Brainfuck implementation will ever catch C for, say, parsing, and I'd be willing to put money on that. This "all Turing-complete languages are on equal performance footing" is nonsense. Just because you can't write a proof that shows a result mathematically does not mean that a difference does not exist.