Inferring the number of loop integrations or recursion levels is in practice impossible when the number depends on the user input. For a system language I woul

Inferring the number of loop integrations or recursion levels is in practice impossible when the number depends on the user input. For a system language I would like to see that when the compiler cannot infer the bound on the stack size or when that static bound exceeds some static limit, a function call is treated as fallible.