Hacker News new | ask | show | jobs
by ddrdrck_ 2403 days ago
I think the point is that it is easier to formally verify a non-Turing-complete PL