Recursive functions are handled partially ATM, for common cases like find(l, i) where the function is called recursively with the same argument. The CFG based approach should solve that by walking a call graph until fixpoint (with some budget). For body-less functions (ones that are defined in C++, e.g. builtin functions like min/max) the language has annotations to provide such information:
@cpp_template("::tpy::min_key({0}, {1}, {2})", borrows=("a", "b"))
def min[T, K: Comparable](a: T, b: T, key: Fn[[T], K]) -> T: ...
(the result may borrow either a or b)
Current approach is to warn because the checks are less precise than what I'd like them to. The idea is to keep it that way for now, migrate to CFG in the future and enable it in a strict mode.