Îõ³h$ê,      !"#$%&'()*+ Trustworthy238ÆÔÙÌdata-fix*Greatest fixed point. Efficient unfolding.data-fix%Least fixed point. Efficient folding.data-fixA fix-point type.data-fixChange base functor in . data-fixLike  but , ping over g. data-fixFold .Ëlet fp = unfoldFix (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)foldFix (elimListF 0 (+)) fp6 data-fixUnfold .ÂunfoldFix (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)ÃFix (Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix (Cons 3 (Fix Nil)))))))) data-fixChange base functor in . data-fixFold .Êlet mu = unfoldMu (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)foldMu (elimListF 0 (+)) mu6data-fixUnfold .ÁunfoldMu (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)ÔunfoldMu unFix (Fix (Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix (Cons 3 (Fix Nil)))))))))data-fixChange base functor in .data-fixFold .Êlet nu = unfoldNu (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)foldNu (elimListF 0 (+)) nu6data-fixUnfold .ÁunfoldNu (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int)ÔunfoldNu unFix (Fix (Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix (Cons 3 (Fix Nil)))))))))data-fix>Refold one recursive type into another, one layer at the time.data-fixMonadic  .data-fixMonadic anamorphism.data-fixMonadic hylomorphism.data-fix&Catamorphism or generic function fold.data-fix'Anamorphism or generic function unfold.data-fix5Hylomorphism is anamorphism followed by catamorphism.data-fixMonadic catamorphism.data-fixMonadic anamorphism.data-fixMonadic hylomorphism.   -      !"#$%&'()*+,-.%data-fix-0.3.1-8V2jDaOqfpv3xj2Y3qj68oData.FixNuMuunMuFixunFixhoistFix hoistFix'foldFix unfoldFixhoistMufoldMuunfoldMuhoistNufoldNuunfoldNurefoldfoldFixM unfoldFixMrefoldMcataanahylocataManaMhyloM $fNFDataFix $fHashableFix $fReadFix $fShowFix$fOrdFix$fEqFix$fReadMu$fShowMu$fOrdMu$fEqMu$fReadNu$fShowNu$fOrdNu$fEqNu $fGenericFix $fDataFixbaseGHC.Basefmap