3 ms·
Type inference goes hand-in-hand with static typing. Those are not opposite things. > C# .... Crystal Both are fully statically typed languages with type infe
by TheDong 9y ago
Type inference goes hand-in-hand with static typing. Those are not opposite things.
> C# .... Crystal
Both are fully statically typed languages with type inference. Those are unrelated to the argument the parent comment is making.
- jaggederest 9y agoThey still both allow generic arguments, in reduction, this means that they still have uncertainty. I can and have built a totally untyped language within a fully statically typed language - nostrademons' Scheme-in-haskell exercise is a lot of fun. You just have to define a Universal type and then back out of all that nasty compile-time nonsense. Everything is Univ and Univ is everything.
- andybak 9y ago> Type inference goes hand-in-hand with static typing. That would imply there's no type inference possible with dynamic languages - either at "compile" time or run time. (Wouldn't it also imply that static typing and strong typing are synonymous?)