Config languages (and Dhall)

Why is Turing-incompleteness important to you? It means that Nickel can enter an infinite loop, yes, but that’s practically not that different from a Dhall program that takes 10^99 years, is it? The advantage Nickel still has over Haskell is that it cannot perform IO so you don’t need to sandbox it.