News for hackers. Stuff that matters.

A comment on Deep learning experiments in OCaml. Parent comment

Re:Deep learning experiments in OCaml by KenoFischer on Friday September 21, 2018 @03:17PM (#18041971)
Look at e.g. Julia for a dynamic system with a strong type system that allows the compiler to reason about the code without forcing completeness.
[ Parent | on HN ]
Re:Deep learning experiments in OCaml by yunfeng_lin on Friday September 21, 2018 @03:31PM (#18042072)
Julia has optional typing which is static as well
[ Parent | on HN ]
Re:Deep learning experiments in OCaml by KenoFischer on Friday September 21, 2018 @03:45PM (#18042144)
As always in these sorts of discussions, it depends how you define your terminology. However, by most definitions of static typing, Julia's type system is not static. The julia type system is very much a property of the runtime language and behaves as such. It is quite strong, true, but still not statically enforced as you would expect from a static language. In particular, (to the extent that you can identify one), you never get any sort of compile-time type errors in julia.
[ Parent | on HN ]