I heard the binary compiled from typed functional languages runs faster than otherwise. Is it true?
If so, why is that? Normally, do typed languages produce faster binaries?
A statically-typed language can produce tighter, faster code because it does not have to do type lookups at every operation. This is true regardless of whether the language is functional, procedural, object-oriented, or imperative.