Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Is Uncle Bob serious?. Parent comment
A sufficiently powerful type system can compute any partial recursive function at type check time. That's pretty much the upper bound.
A sufficiently powerful type system can compute any partial recursive function at type check time. That's pretty much the upper bound.