For the record, Starlark has some restrictions: no infinite loops, no access to the world, etc. It's true that computations could be arbitrary long (as with mo

For the record, Starlark has some restrictions: no infinite loops, no access to the world, etc. It's true that computations could be arbitrary long (as with most other languages). Bazel has a flag to reduce this kind of problem (--max_computation_steps).