That's already been granted in this argument. The question now is, given an infinite stack, is this programming style Turing-complete?