Yes. My point is that: 1. "No cycles in call graph" is not about memory usage but about having an easily provable limit on call stack and 2. "No cycles in call graph" is not about banning recursion.

I agree that the call stack limit is much more important in environments with tight memory but the rule is about the stack limit, not memory in general.

Edit: for 2. I obviously mean recursion as the class of algorithms, not as the property of the functions used to implement it.