4 ms·
> What would you think if the following were true for a fairly generalized problem: > - It is easy to prove a particular upper bound on memory requirements Th
by a1369209993 6y ago
> What would you think if the following were true for a fairly generalized problem:
> - It is easy to prove a particular upper bound on memory requirements
That they should have included said proof in the source code (in a comment if the type system isn't expressive enough to run it).