Allow more aggressive inference for some functions

[aplavin]

Sometimes, code that is fundamentally type-stable, doesn't get inferred by the Julia compiler due to heuristic inference bounds. I saw Bounded recursion detected. Call was widened to force convergence. in Cthulhu quite a few times, with nested calls to the same function: this happened to me with HOFs like Base.map or Accessors.modify, sometimes with closures added on top (but not necessarily). Surely many others also encountered such an issue, there are at least a couple of related discussions on discourse.

Would it be feasible to let certain functions opt into a more aggressive inference? I'm not sure what the exact recursion limit is set to for now, but letting function authors increase it by a factor of a few would often be useful. This would help composability, because in reality one doesn't just care about whether the result of a composition is correct, but also how performant the code is.

Also I don't know whether this limit is currently defined per-function, per-method, or per-module, and how easy it is to change it locally. But something along these lines would really help!