Hacker News new | past | comments | ask | show | jobs | submit login

> The other common proposition is that dynamically typed languages are faster to write in than statically typed languages.

This part is also very tricky, as most of people's hard-earned experience with this is (almost by definition) old. In recent years, type inference has reduced the type-caused slowdown immensely. E.g. in Haskell you can (+) write large statically typed programs without specifying any types at all - they are inferred by the compiler.

(+) But please don't.




Heh I had to parse your sentence twice as (+) is a function in Haskell.


Recent years? 70s more like.

ML way is to not write type annotations unless they're needed, not that I agree with it, but it certainly works in some way.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: