3 ms·
Also: tests don't prove the absence of errors, only their presence. Static types prove the absence of some errors. Any type snob will tell you that even in su
by alkonaut 9y ago
Also: tests don't prove the absence of errors, only their presence.
Static types prove the absence of some errors.
Any type snob will tell you that even in supposedly good type systems, without dependent types, all lists are dynamic! Yet most of us that swear by static types don't use dependent types (much). There might be a limit where "more types" don't pay off their added cost relative to the thinking and typing needed and the security gained.
Where that limit is depends on the application. Formally verified programs aren't used for many simple web backends - for good reason.
Also, type systems aren't equal. There are decent dynamic ones and terrible ones. Same goes for static type systems.
- continuational 9y agoAs for dependent types, it's probably just that the type systems for them are simply not yet mature enough to be practical for most tasks.
- seanwilson 9y agoIf you're using a dependently typed language, you have to write maths proofs to prove properties hold. It's incredibly challenging and not going to be automated any time soon.
- agentultra 9y agoI think that's going to change. It's my completely biased, uninformed opinion that dependently typed systems are much easier to reason about than their counterparts.