3 ms·
I'd consider Starlark more obscure and less well-supported/documented than Dhall.
by lmm 3y ago
I'd consider Starlark more obscure and less well-supported/documented than Dhall.
- IshKebab 3y agoMaybe. But Dhall falls into the "weird and aggressively functional" category. The syntax is obstinately weird. `let in`? Why. Just use `let`. `\(` for functions? Is `fn` too much? It also isn't a "full" programming language - it's not Turing complete, which has no real benefit as far as I can tell. Tbh it's probably one of the better options, but I can predict how my co-workers would react if I tried to get them to use it. I think they would be more accepting of Starlark.
- lmm 3y ago> The syntax is obstinately weird. `let in`? Why. Just use `let`. `\(` for functions? Is `fn` too much? It's inherited from OCaml/Haskell/etc.. I think staying consistent with that works better than trying to convert it to Algol-style, although I guess the jury is still out on new languages that do that. > It also isn't a "full" programming language - it's not Turing complete, which has no real benefit as far as I can tell. The most immediate practical benefit is that your configurations can't go into an infinite loop. Depending on your deployment model that can help avoid outages. 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.
- 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.