Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.