3 ms·
Any sufficiently advanced type system necessarily becomes Turing complete because type systems generalize to full compile time programming
by Kinrany 3y ago
Any sufficiently advanced type system necessarily becomes Turing complete because type systems generalize to full compile time programming