Not sure I understand all of what Graydon wrote about sub-Turing languages but it seems like:
"timed automata and visibly-pushdown automata" + "a kind of extension of interface definition languages\ to cover (branching) sequences of permitted calls and returns." + "formulae in temporal logics that range over possible\ computation paths within a formal system." = reliable programming for many problem domains
If it produces:
"a language that targets compilation into reliable components, and networks-of-components, that are guaranteed to behave well; that push general-purpose languages to the periphery of those networks, as byzantine actors."