W\P}      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~   non-portable experimentalgenerics@haskell.org non-portable experimentalgenerics@haskell.orgHDatatype to represent the fixity of a constructor. An infix declaration + directly corresponds to an application of . 6Class for datatypes that represent data constructors. % For non-symbolic constructors, only   has to be defined. 8 The weird argument is supposed to be instantiated with C from  base, hence the complex kind.        non-portable experimentalgenerics@haskell.org /Semi-decidable equality for types of a family. CClass that contains the shallow conversion functions for a family. #Class for the members of a family. 8Type family describing the pattern functor of a family. Unlifted version of '&. Unlifted version of *). Represents constructors. $Is used to indicate the type that a $ particular constructor injects to. <Represents products (sequences of fields of a constructor). !0Represents sums (choices between constructors). $(Represents constructors without fields. &<Represents constant types that do not belong to the family. )=Represents recursive positions. The first argument indicates  which type to recurse on. ,Destructor for '(:>:)'. -Destructor for . .+For backwards-compatibility: a synonym for . /  !"#$%&'()*+,-.")*+&'($%!#" ,-. "  !#""#$%%&'('()*+*+,-. non-portable experimentalgenerics@haskell.org/6Given a list of datatype names, derive datatypes and  instances of class  . 03Given the name of the index GADT, the names of the 7 types in the family, and the name (as string) for the ) pattern functor to derive, generate the Ix and   instances.  IMPORTANT&: It is assumed that the constructors 9 of the GADT have the same names as the datatypes in the  family. 1)Compatibility. Use deriveFamily instead. 2Derive only the  instance. Not needed if 0  is used. 3Derive only the  instances. Not needed if 0  is used. 4Dervie only the  instance. Not needed if 0  is used. 5Derive only the   instance. Not needed if 0  is used. /012345/012345/012345 non-portable experimentalgenerics@haskell.org6786786778 non-portable experimentalgenerics@haskell.org; The function ; takes a functor f. All the recursive instances 2 in that functor are wrapped by an application of r. The argument to  ;# takes a function that transformes r occurrences into r'  occurrences, for every ix". In order to associate the index ix  with the correct family phi, the argument to hmap is additionally $ parameterized by a witness of type phi ix. <Monadic version of ;. 9:;<9:;<9::;< non-portable experimentalgenerics@haskell.org=>?@ABCDEFGHIJKLMNOPQRSJIHGKLFEDCMNBA@?OP>=QRS=>?@ABCDEFGHIJKLMNOPQRS non-portable experimentalgenerics@haskell.orgTUVWXTUVWXTUVUVWX  non-portable experimentalgenerics@haskell.orgYZ[\]^_`abcdefghijklmnofedcghba`_ij^]\[klZYmnoYZ[\]^_`abcdefghijklmno  non-portable experimentalgenerics@haskell.orgp<The class fold explains how to convert a convenient algebra  s : back into a function from functor to result, as required " by the standard fold function. rAThe algebras passed to the fold have to work for all index types C in the family. The additional witness argument is required only  to make GHC's typechecker happy. s<The type family we use to describe the convenient algebras. tFold with convenient algebras. u?For constructing algebras that are made of nested pairs rather D than n-ary tuples, it is helpful to use this pairing combinator. pqrstusrpqtupqqrstu  non-portable experimentalgenerics@haskell.orgv<The class fold explains how to convert a convenient algebra  y : back into a function from functor to result, as required " by the standard fold function. xAThe algebras passed to the fold have to work for all index types C in the family. The additional witness argument is required only  to make GHC's typechecker happy. y<The type family we use to describe the convenient algebras. zFold with convenient algebras. {?For constructing algebras that are made of nested pairs rather D than n-ary tuples, it is helpful to use this pairing combinator. vwxyz{yxvwz{vwwxyz{  non-portable experimentalgenerics@haskell.org|Normal version. }Monadic version of | . ~Applicative version of | . |}~|}~|}~  non-portable experimentalgenerics@haskell.org non-portable experimentalgenerics@haskell.org non-portable experimentalgenerics@haskell.orgZ  !"#$%&'()*+,-.9:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWX|}~ !"#$%%&''())*+,,-./0011233456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a F G H I J K L M N O P Q R S T U V W X Y Z [ \ b c R d T Z b c R d T Z e f g h i jklmnop multirec-0.4Generics.MultiRec.TEqGenerics.MultiRec.ConstructorGenerics.MultiRec.BaseGenerics.MultiRec.THGenerics.MultiRec.ConNamesGenerics.MultiRec.HFunctorGenerics.MultiRec.FoldGenerics.MultiRec.HFixGenerics.MultiRec.FoldKGenerics.MultiRec.FoldAlgGenerics.MultiRec.FoldAlgKGenerics.MultiRec.ComposGenerics.MultiRec.EqGenerics.MultiRec.ShowGenerics.MultiRec:=:Reflcast AssociativityNotAssociativeRightAssociativeLeftAssociativeFixityInfixPrefix ConstructorconName conFixityEqSeqSFamfromtoElproofPFK0unK0I0unI0C:>:Tag:*::+:RLUKunKIunIunTagunCindexderiveConstructors deriveFamily deriveSystemderivePFderiveEl deriveFam deriveEqSConNames hconNamesconNamesHFunctorhmapAhmaphmapM:->AlgPart ParaAlgebraF ParaAlgebraF' ParaAlgebra ParaAlgebra' CoAlgebraF CoAlgebraF' CoAlgebra CoAlgebra'AlgebraF AlgebraF'AlgebraAlgebra'foldfoldMunfoldunfoldMparaparaM&tagconHFixHInhouthfromhtoFoldalgAlgcomposcomposMcomposAHEqheqeqHShow hShowsPrecAlg showsPrecshowspaces