3 ms·
Isn't that irrelevant in that case? If the type checker takes too long, sonething isn't right.
by k__ 9y ago
Isn't that irrelevant in that case?
If the type checker takes too long, sonething isn't right.
- naasking 9y agoHow could you possibly quantify "too long" when you can perform arbitrary computation at compile-time? How do you know the library you're using doesn't need you to compute and embed the first N primes in the final output? At least if your type checker weren't Turing complete, you know it will finish at some point.