Ji?      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~SafeNoneOT Rules of renaming data names9Build base functor with a sensible default configuration.e.g. `data Expr a = Lit a | Add (Expr a) (Expr a) | Expr a :* [Expr a] deriving (Show)  ''Expr  will create Gdata ExprF a x = LitF a | AddF x x | x :*$ [x] deriving (, , ) type instance Base (Expr a) = ExprF a instance  Recursive (Expr a) where project (Lit x) = LitF x project (Add x y) = AddF x y project (x :* y) = x :*$ y instance  Corecursive (Expr a) where embed (LitF x) = Lit x embed (AddF x y) = Add x y embed (x :*$ y) = x :*$ y   =   Notes:n works properly only with ADTs. Existentials and GADTs aren't supported, as we don't try to do better than  lhttps://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#deriving-functor-instancesGHC's DeriveFunctor./Build base functor with a custom configuration.Default  : prepend F or $, to data type, constructors and field names."How to name the base functor type.Default is to prepened F or $.1How to rename the base functor type constructors.Default is to prepened F or $.=How to rename the base functor type field names (in records).Default is to prepened F or $.$makes clauses to rename constructorsNormalized the Con type into a uniform positional representation, eliminating the variance between records, infix constructors, and normal constructors.Extraty type variables&Apply arguments to a type constructor.Provides substitution for types+(constructor name, field name, field type'Safe05Base Functor for     (C) 2008-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> experimental non-portableSafe%&/059:;<DORT%Base functor of [].,Fokkinga's postpromorphism-A generalized postpromorphism3Fokkinga's prepromorphism<A generalized catamorphism=A generalized catamorphism?A generalized anamorphism@A generalized anamorphismBA generalized hylomorphismCA generalized hylomorphism1Lambek's lemma provides a default definition for / in terms of 0 and )>The dual of Lambek's lemma, provides a default definition for ) in terms of * and /QCourse-of-value iterationWMendler-style iterationX'Mendler-style course-of-value iterationYElgot algebrasZElgot coalgebras: 0http://comonad.com/reader/2008/elgot-coalgebras/[!Zygohistomorphic prepromorphisms:&A corrected and modernized version of Chttp://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphismsWRead a list (using square brackets and commas), given a function for reading elements.v/It may be better to work with the instance for  directly.v !"#$%&'()*+,-./0123456789:;<a distributive lawa (Base t)-w-algebra fixed point=a distributive lawa (Base t)-w-algebra fixed point>?a distributive lawa (Base t)-m-coalgebraseed@a distributive lawa (Base t)-m-coalgebraseedABCDEFGHIJ(A distributive for semi-mutual recursionKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~= !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[=5%&'#$G!" ./01234M<IKQRDUV>67JLSTEF()*+,-?ANOP8BH9=:@;CWXYZ[f !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%%&&''()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~.recursion-schemes-5.0.1-G9MGaA1GARw8KpT7IWaxuqData.Functor.Foldable.THData.Functor.BaseData.Functor.FoldablePaths_recursion_schemes Data.ListNonEmpty BaseRulesmakeBaseFunctormakeBaseFunctorWith baseRules baseRulesType baseRulesConbaseRulesField NonEmptyFheadtail$fBitraversableNonEmptyF$fBifoldableNonEmptyF$fBifunctorNonEmptyF$fTraversableNonEmptyF$fFoldableNonEmptyF$fFunctorNonEmptyF$fRead1NonEmptyF$fRead2NonEmptyF$fShow2NonEmptyF$fShow1NonEmptyF$fOrd1NonEmptyF$fOrd2NonEmptyF$fEq1NonEmptyF$fEq2NonEmptyF $fEqNonEmptyF$fOrdNonEmptyF$fShowNonEmptyF$fReadNonEmptyF$fGenericNonEmptyF$fGeneric1NonEmptyFNuMuFixListFNilCons Corecursiveembedanaapopostprogpostpro RecursiveprojectcataparagparapreprogpreproBasedistPara distParaThylofoldunfoldrefoldgcatagfolddistCataganagunfolddistAnaghylogrefoldfutudistFutu distGFutuunfixrefixzygodistZygogzygo distZygoTgapodistApodistGApo distGApoThistoghisto distHisto distGHistochronogchronomcatamhistoelgotcoelgotzygoHistoPrepro$fReadNu$fShowNu$fOrdNu$fEqNu $fRecursiveNu$fCorecursiveNu$fCorecursiveF $fRecursiveF$fReadMu$fShowMu$fOrdMu$fEqMu$fCorecursiveMu $fRecursiveMu$fCorecursiveFix$fRecursiveFix $fReadFix $fShowFix$fOrdFix$fEqFix$fCorecursiveEither$fRecursiveEither$fCorecursiveMaybe$fRecursiveMaybe$fCorecursiveFreeT$fRecursiveFreeT$fCorecursiveFree$fRecursiveFree$fCorecursiveCofreeT$fRecursiveCofreeT$fCorecursiveCofree$fRecursiveCofree$fCorecursiveNonEmpty$fRecursiveNonEmpty$fCorecursive[] $fRecursive[]$fBitraversableListF$fBifoldableListF$fBifunctorListF$fTraversableListF$fFoldableListF$fFunctorListF $fRead1ListF $fRead2ListF $fShow2ListF $fShow1ListF $fOrd1ListF $fOrd2ListF $fEq1ListF $fEq2ListF $fEqListF $fOrdListF $fShowListF $fReadListF$fGenericListF$fGeneric1ListF $fDataFixcatchIOversionbindirlibdir dynlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNamebaseGHC.BaseFunctor Data.FoldableFoldableData.Traversable Traversable mkMorphismnormalizeConstructortypeVarsconAppsT substTypeLens'_baseRulesType _baseRulesCon_baseRulesFieldtoFNamemakePrimForDecmakePrimForDec'conNameTraversalconFieldNameTraversalconTypeTraversal conNameMapconFieldNameMap conTypeMappairSnd tripleTrd tripleFst varBindName isSymbolChar isPuncChar rsPackageKey mkRsName_tc mkRsName_v baseTypeNamerecursiveTypeNamecorecursiveTypeNameprojectValName embedValNamefunctorTypeNamefoldableTypeNametraversableTypeNamelambekcolambek _readListWith"free-4.12.4-LgcX9hrtnan8i9EaOvHXkRControl.Monad.Free.ChurchFimproveFtoFixfromFixcmfcCata