News for hackers. Stuff that matters.
Re:Is Uncle Bob serious? by kazinator on Tuesday October 10, 2017 @10:04AM (#15441837)
> I'm not sure you're familiar enough with what a sufficiently powerful type system can accomplish.

A sufficiently powerful type system can compute any partial recursive function at type check time. That's pretty much the upper bound.

Re:Is Uncle Bob serious? by kazagistar on Tuesday October 10, 2017 @10:55AM (#15442292)
The upper bound is arbitrary code, and validating arbitrary proofs.