3 ms·
This raises an interesting question that I hadn't considered before: how many of the programs that we write every day actually rely on the Turing-completeness o
by kibwen 15y ago
This raises an interesting question that I hadn't considered before: how many of the programs that we write every day actually rely on the Turing-completeness of their underlying languages? If the statically-verifiable properties of, whaddya call it, strong functional programming outweigh the loss of expressiveness, there could be a big market for general-purpose (is that a contradiction?) languages of this bent.
Throw it on the pile of Things That Could Be The Next Big Thing, Maybe--right on top of declarative programming and highly-concurrent programming.