"taxonomize a list of the general recursion schemes I have seen, cite the original references for them where available, and provide a concise implementation of each and try to motivate the connections between them"
General (nearly all monads compose), mathematically elegant (use the standard categorical tools underpinning monads) and computationally expressive (support a canonical recursion operator).