Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Sounds like you're describing Haskell.

I don't think Ada is that strict.



Ada has the advantage of not being weird though. :)

Also, at least back then, Ada has no garbage collection, so you know what latencies are.


malloc / free style memory management has unbounded latency, too. Though Ada might do something even more conservative.


Ada uses its type system plus managed memory pools for manual memory management, it's very cool. Safe manual memory management with memory control of C/C++ but the safety of an ML.

http://en.wikibooks.org/wiki/Ada_Programming/Types/access


Ada is very strict; its type system might not be as well-planned as Haskell's, but it's both strict and effective.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: