3 ms·
The OCaml type system is a really weak form of theorem proving-- the fanciest usable thing you can do is phantom types. When algorithmic trading software gets
by iskander 16y ago
The OCaml type system is a really weak form of theorem proving-- the fanciest usable thing you can do is phantom types.
When algorithmic trading software gets written in Agda then your comment might make more sense.
- jrockway 16y agoYou can run theorem provers on top of these languages, though.