úÎ!r„5      !"#$%&'()*+,-./01234None 3<CFQTV8 recursionA map of \( F \)-coalgebras  recursion Base functor for a list of type [a]. recursion7Anamorphism, meant to build up a structure recursively. recursion&Catamorphism. Folds a structure. (see  Qhttp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.125&rep=rep1&type=pdfhere) recursion5Hylomorphism; fold a structure while buildiung it up. recursionVPrepromorphism. Fold a structure while applying a natural transformation at each step. recursionWPostpromorphism. Build up a structure, applying a natural transformation along the way. recursionA mutumorphism. recursion\Catamorphism collapsing along two data types simultaneously. Basically a fancy zygomorphism. recursionZygomorphism (see  -http://www.iis.sinica.edu.tw/~scm/pub/mds.pdfhere for a neat example) recursion Paramorphism  recursion]Gibbons' metamorphism. Tear down a structure, transform it, and then build up a new structure! recursion›Erwig's metamorphism. Essentially a hylomorphism with a natural transformation in between. This allows us to use more than one functor in a hylomorphism." recursionMendler's catamorphism# recursionMendler's histomorphism$ recursionElgot algebra (see  https://arxiv.org/abs/cs/0609040 this paper)% recursionAnamorphism allowing shortcuts.& recursionElgot coalgebra' recursion Apomorphism( recursion6A lens parametric in an \( F \)-coalgebra that allows b to inspect itself. recursionA (Base t) -coalgebra recursionA  (Base t') -coalgebra)  !"#$%&'()   '$&% !(#"5      !"#$%&'()*+,-./0123(recursion-1.1.0.0-8kJrrTJ276dKD1hbY86alJControl.RecursionLens'MuNuFixunFix NonEmptyFListFConsNil Corecursiveembedana RecursiveprojectcataBasehylocataManaMhyloMlambekcolambekprepropostpromutudicatazygoparametameta'mcatamhistoelgotmicrocoelgotapochema$fRecursiveNatural$fCorecursiveNatural$fCorecursive[] $fRecursive[]$fCorecursiveNonEmpty$fRecursiveNonEmpty$fCorecursiveNu $fRecursiveNu$fCorecursiveMu $fRecursiveMu$fFunctorListF$fFunctorNonEmptyF