Tom Lane wrote:
> A depth limit for PL-function recursion is perhaps feasible, but I can't
> say that I care for it a whole lot ... anyone have better ideas?
>
Is there any way to recognize infinite recursion by analyzing the saved
execution tree -- i.e. can we assume that a function that calls itself, with
the same arguments with which it was called, constitutes infinite recursion?
Joe
