> From a type-theoretic perspective, a language can be either logically consistent by means of strong normalization xor Turing-complete. This is a common misconception. A counter-example: take System F, add an `IO`…
> From a type-theoretic perspective, a language can be either logically consistent by means of strong normalization xor Turing-complete. This is a common misconception. A counter-example: take System F, add an `IO`…