3 ms·
> Bad bad point. There are statically-typed languages with fairly complex type systems. There are even dependently typed languages which check essentially any p
by bjourne 7y ago
> Bad bad point. There are statically-typed languages with fairly complex type systems. There are even dependently typed languages which check essentially any property of you values and can be used to prove your program correct.
Which are those languages? Can you show me how to use dependent typing to ensure that an integer is a prime number in such a language? Because I don't think you can do that, at least not using convenient syntax.
- uryga 7y ago[Idris - Define a 'Prime' type](https://stackoverflow.com/q/46132987/5534735 https://stackoverflow.com/q/46132987/5534735) it looks pretty weird tbh. the ergonomics of dependent types are an open area of research