4 ms·
It is most definitely true for numeric programming (and Haskell is _somewhat_ dependently typed). For example, look at this finite bit width concatenation opera
by tome 2y ago
It is most definitely true for numeric programming (and Haskell is _somewhat_ dependently typed). For example, look at this finite bit width concatenation operation:
https://hackage.haskell.org/package/clash-prelude-1.8.2/docs/Clash-Sized-BitVector.html#v:-43--43--35- https://hackage.haskell.org/package/clash-prelude-1.8.2/docs...
How it compares to Ada though, I could not say.
- astrange 2y agoBy "support" I don't mean that you can do it. Rather I meant the opposite - it doesn't stop you from doing it incorrectly. There isn't a lot of thought put into ranged integer types, floating point modes, etc.
- tome 2y agoI see. You're probably correct about that. I guess I got thrown off by your suggestion that dependently typed provide good support for numeric programming, because I doubt any dependently typed language that put a lot of thought into floating point modes (and I'm not aware any has particularly good suppose for ranged integer types either, but I could just be uneducated in that regard).