Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
YellPika
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
YellPika
11y ago
> 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` monad, and add a funct