Well-founded recursion
= Well-founded recursion
A recursive definition in which the value at a point depends on its predecessor values in a <well-founded relation>. For a class relation, set-likeness allows the local set recursions to combine into a class function.