Our great sponsors
-
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
> And, if you think that a type system can be no help with some family of data structures, it can only because you are unfamiliar with powerful type systems.
I am. Would you please point me at some things to study?
The best I can imagine is languages like F* (https://www.fstar-lang.org/, and more specifically the Low* subset for dealing with memory) which make you prove everything. And thus are such a PITA to program in that it make sense to code only the most security-demanding things.
Dependant types are also not able to protect you from memory bugs in self-referential datastructures AFAIK.
I am open to reading about research in PL. But if you point me at some mainstream (or just production-ready) languages/runtimes it would be even better.
Thanks.
Related posts
- If You've Got Enough Money, It's All 'Lawful'
- [Hobby] Amateur Generalist Programmer Seeking to Put Bugfixing Skills to Good Use
- Rust in Perspective (the author, Linus Walleij, is a Linux kernel contributor)
- Have you ever used F* ? Can you ELI5 its use case?
- F* – Microsoft's programming language with a superset of features over F#