3 ms·
> Zig > undecidable, since evaluation of recursive functions at compile time is possible, thus requiring the compiler to solve the halting problem. Zig's comp
by daurnimator 6y ago
> Zig
> undecidable, since evaluation of recursive functions at compile time is possible, thus requiring the compiler to solve the halting problem.
Zig's comptime is limited to the number of backwards branches you allow, see https://ziglang.org/documentation/master/#setEvalBranchQuota https://ziglang.org/documentation/master/#setEvalBranchQuota
- steerablesafe 6y agoThat's kind of weak. It is similar to implementation limits in C++ type checking. No C++ compiler will hang in an infinite loop either.