3 ms·
> In theory you could still create a configuration that would take a very long time to evaluate, but in practice that's a lot rarer than creating one that takes
by IshKebab 3y ago
> In theory you could still create a configuration that would take a very long time to evaluate, but in practice that's a lot rarer than creating one that takes forever.
Yeah I'm not sure I buy it. There are much easier ways to prevent accidental infinite loops than artificially making your language Turing incomplete.
Probably the most obvious is a compute budget (i.e. a timeout but deterministic).
- lmm 3y ago> There are much easier ways to prevent accidental infinite loops than artificially making your language Turing incomplete. Then how come none of them are popular in config languages? Starlark follows the same approach of being non-Turing-complete; all the other config languages I know of are either non-Turing-complete or accept the risk of running forever. > Probably the most obvious is a compute budget (i.e. a timeout but deterministic). That tends to have worse problems e.g. seemingly "safe" refactors can now break your config.