Eliminating deadlocks with a type system is just as possible as eliminating data races (albeit maybe a bit more awkward). The question of Turing completeness doesn&#x27;t really come into it, because you are rejecting some dynamically correct programs with a static type system.