mutual recursion


Also found in: Wikipedia.

mutual recursion

References in periodicals archive ?
For any call graph G, there exists a mutual recursion elimination sequence if and only if every SCC is 1-coverable.
Thus, by the corollary to Lemma 7, no amount of inlining within that SCC can remove all mutual recursion.