y      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafe(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeQR,  !"#$%&'()*+,-./012345   '   !"#$%&'()*+,-./012345(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe7 Iduplicated = extended id fmap (fmap f) . duplicated = duplicated . fmap f8 !extended f = fmap f . duplicated6789:;<=>?@ABCDEFGH6786786789:;<=>?@ABCDEFGH(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeK a X b "a    a W b L a Y b "a   a W b MA  sans .Minimal definition: Either O or NNIf defining both, then the following laws (the default definitions) must hold: )join = (>>- id) m >>- f = join (fmap f m)Laws: 2induced definition of <.>: f <.> x = f >>- (<$> x)0Finally, there are two associativity conditions: associativity of (>>-): (m >>- f) >>- g == m >>- (\x -> f x >>- g) associativity of join: join . join = join . fmap join>These can both be seen as special cases of the constraint that 9associativity of (->-): (f ->- g) ->- h = f ->- (g ->- h)P7Transform a Apply into an Applicative by adding a unit.SWrap an  to be used as a member of VVBA strong lax semi-monoidal endofunctor. This is equivalent to an  without .Laws: ()  u W v W w = u W (v W w) x W (f  y) = ( f)  x W y f  (x W y) = (f )  x W y The laws imply that X and Y really ignore their left and right results, respectively, and really return their right and left results, respectively. Specifically, (mf  m) X (nf  n) = nf  (m X n) (mf  m) Y (nf  n) = mf  (m Y n) X  a X b =    a W bY  a Y b =   a W bkA  is not a , but it is an instance of MnAn  is not a , but it is an instance of MoA  is not a , but it is an instance of MA  is not , but it is an instance of VAn IntMap is not , but it is an instance of V A Map is not , but it is an instance of VwIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~IJLKMONPQRSTUVWYXZ[VWXYSTUPQRMNO[ZIJKLkIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~J4K4L4N1W4X4Y4(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe A variant of W with the arguments reversed.2Lift a binary function into a comonad with zipping3Lift a ternary function into a comonad with zippingPQRSTUVWYXVWXYSTUPQR4(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeMONPQRSTUVWYXZ[VWXYSTUPQRMNO[Z111(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe1A subset of monad transformers can transform any M as well.  (C) 2007-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe+D sans  Ahttp://en.wikipedia.org/wiki/Band_(mathematics)#Rectangular_bands (C) 2007-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe+D (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafe+9;Dsemigroupoid with inverses. This technically should be a category with inverses, except we need to use Ob to define the valid objects for the category (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafe+D (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> experimentalnon-portable (flexible MPTCs)Safe+9:;<=D (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeFUsable default for foldMap, but only if you define bifoldMap1 yourself   (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportable Trustworthy<OQRTLaws: <!> is associative: (a <!> b) <!> c = a <!> (b <!> c) <$> left-distributes over <!>: f <$> (a <!> b) = (f <$> a) <!> (f <$> b)If extended to an  then  should equal .Ideally, an instance of I also satisfies the "left distributon" law of MonadPlus with respect to W: I<.> right-distributes over <!>: (a <!> b) <.> c = (a <.> c) <!> (b <.> c)But , ,  a,  e m, and STM3 satisfy the alternative "left catch" law instead: pure a <!> b = pure aPHowever, this variation cannot be stated purely in terms of the dependencies of .rWhen and if MonadPlus is successfully refactored, this class should also be refactored to remove these instances.BThe right distributive law should extend in the cases where the a M or @ is provided to yield variations of the right distributive law: S(m <!> n) >>- f = (m >>- f) <!> (m >>- f) (m <!> n) >>= f = (m >>= f) <!> (m >>= f) without a required empty-This instance does not actually satisfy the (W3) right distributive law It instead satisfies the  Left-Catch law*      !"#$PQRSTUVWYX%      !"#$3(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeQR%Laws: zero <!> m = m m <!> zero = mIf extended to an  then & should equal ."%&'()*+,-./0123456789:;<=>?@ABCDEFPQRSTUVWYX%&%&!%&'()*+,-./0123456789:;<=>?@ABCDEF(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafeGHIJKLMNOPQRSTUVGHIGHIGHIJKLMNOPQRSTUV(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeW Insert an m- between each pair of 't m'. Equivalent to X with  as the second argument.4intercalate1 ", " $ "hello" :| ["how", "are", "you"]"hello, how, are, you"!intercalate1 ", " $ "hello" :| []"hello"3intercalate1 mempty $ "I" :| ["Am", "Fine", "You?"] "IAmFineYou?"XInsert m between each pair of m derived from a.0intercalateMap1 " " show $ True :| [False, True]"True False True"%intercalateMap1 " " show $ True :| []"True"\DUsable default for foldMap, but only if you define foldMap1 yourself^lMonadic fold over the elements of a non-empty structure, associating to the right, i.e. from right to left. \let g = (=<<) . f in foldrM1 f (x1 :| [x2, ..., xn]) == x1 `g` (x2 `g` ... (xn-1 `f` xn)...)_kMonadic fold over the elements of a non-empty structure, associating to the left, i.e. from left to right. flet g = flip $ (=<<) . f in foldlM1 f (x1 :| [x2, ..., xn]) == (...((x1 `f` x2) `g` x2) `g`...) `g` xnWXYZ[\]^_`abc WXYZ[\]^_ WXYZ[\]^_WXYZ[\]^_`abc(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeQR+defghijklmnopqrstuvwxyz{|}~defghighidef'defghijklmnopqrstuvwxyz{|}~(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeghighi(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafedefdef(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeLift binary functionsLift ternary functions  IJLK IJKL 4 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkllmnopqrstuvwxyz{|}~                          !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^__`abcdefghijklmnopqrstuvwxyz{|}~    *semigroupoids-5.2.1-3le28CXr7MP52I4Yrw2xuCData.Functor.ApplyData.Bifunctor.ApplyData.Semigroup.Foldable.ClassData.Functor.ExtendData.Functor.BindData.Functor.Bind.ClassData.Functor.Bind.TransData.SemigroupoidData.Semigroupoid.Dual Data.GroupoidData.IsomorphismData.Semigroupoid.ObData.Semigroup.BifoldableData.Functor.AltData.Functor.PlusData.Semigroupoid.StaticData.Semigroup.Foldable Data.Semigroup.Traversable.ClassData.Semigroup.BitraversableData.Semigroup.TraversableData.Traversable.InstancesbaseGHC.BasefmapFunctorData.Bifunctorsecondfirstbimap Bifunctor Data.Functor$><$><$'bifunctors-5.4.2-L4GiuXGjqdMGIFwxc9RMJKData.Biapplicative<<$>> Bifoldable1bifold1 bifoldMap1 Foldable1fold1foldMap1 toNonEmpty$fFoldable1Joker$fFoldable1(,)$fFoldable1NonEmpty$fFoldable1Sum$fFoldable1Reverse$fFoldable1Product$fFoldable1Lift$fFoldable1Compose$fFoldable1Backwards$fFoldable1IdentityT$fFoldable1Tagged$fFoldable1Identity$fFoldable1Tree$fFoldable1Complex$fBifoldable1WrappedBifunctor$fBifoldable1Tannen$fBifoldable1Product$fBifoldable1Joker$fFoldable1Join$fBifoldable1Flip$fBifoldable1Clown$fBifoldable1Biff$fBifoldable1Tagged$fBifoldable1Const$fBifoldable1(,,,,)$fBifoldable1(,,,)$fBifoldable1(,,)$fBifoldable1(,)$fBifoldable1Either$fBifoldable1Arg$fFoldable1:.: $fFoldable1V1$fFoldable1:+:$fFoldable1:*:$fFoldable1Par1 $fFoldable1M1$fFoldable1Rec1Extend duplicatedextended $fExtendSum$fExtendNonEmpty$fExtendIdentityT$fExtendIdentity$fExtendTracedT$fExtendStoreT $fExtendEnvT $fExtendTree $fExtendSeq $fExtend(->) $fExtend(,)$fExtendEither $fExtendMaybe $fExtendProxy$fExtendTagged $fExtend[]Biapply<<.>>.>><<.Bind>>-join MaybeApply runMaybeApplyWrappedApplicativeWrapApplicativeunwrapApplicativeApply<.>.><. returning apDefault$fBiapplyWrappedBifunctor$fBiapplyTannen$fBiapplyProduct $fApplyJoin$fBiapplyJoker $fBiapplyFlip$fBiapplyClown $fBiapplyBiff$fBiapplyTagged$fBiapplyConst$fBiapply(,,,,)$fBiapply(,,,) $fBiapply(,,) $fBiapplyArg $fBiapply(,) $fBindHashMap $fBindTree $fBindSeq $fBindIntMap $fBindMap $fBindComplex $fBindContT $fBindRWST $fBindRWST0 $fBindStateT $fBindStateT0 $fBindWriterT$fBindWriterT0 $fBindReaderT $fBindExceptT $fBindErrorT $fBindListT $fBindMaybeT$fBindWrappedMonad$fBindIdentityT$fBindIdentity $fBindOption $fBindMaybe$fBindIO$fBindNonEmpty$fBind[] $fBind(->) $fBindProduct $fBindEither $fBindProxy $fBindTagged $fBind(,)$fApplyCokleisli$fComonadMaybeApply$fExtendMaybeApply$fApplicativeMaybeApply$fApplyMaybeApply$fFunctorMaybeApply$fAlternativeWrappedApplicative$fApplicativeWrappedApplicative$fApplyWrappedApplicative$fFunctorWrappedApplicative$fApplyTracedT $fApplyStoreT $fApplyEnvT $fApplyContT $fApplyRWST $fApplyRWST0 $fApplyStateT$fApplyStateT0$fApplyWriterT$fApplyWriterT0 $fApplyListT$fApplyReaderT$fApplyExceptT $fApplyErrorT $fApplyMaybeT$fApplyHashMap $fApplyTree $fApplySeq $fApplyIntMap $fApplyMap$fApplyComplex$fApplyWrappedArrow$fApplyWrappedMonad$fApplyIdentityT$fApplyIdentity $fApplyOption $fApplyMaybe $fApplyIO $fApply[]$fApplyZipList $fApply(->) $fApplyConst $fApplyEither$fApplyNonEmpty $fApply(,)$fApplyReverse$fApplyProduct $fApplyLift$fApplyConstant$fApplyCompose$fApplyBackwards $fApplyProxy $fApplyTagged<..>liftF2liftF3-<<->--<- BindTransliftB$fBindTransContT$fBindTransRWST$fBindTransRWST0$fBindTransStateT$fBindTransStateT0$fBindTransWriterT$fBindTransWriterT0$fBindTransReaderT$fBindTransIdentityTSemigetSemiWrappedCategory WrapCategoryunwrapCategory Semigroupoido$fSemigroupoidTYPETagged$fSemigroupoidTYPEConst$fCategorykSemi$fSemigroupoidkSemi$fCategorykWrappedCategory$fSemigroupoidkWrappedCategory$fSemigroupoidTYPEOp$fSemigroupoidTYPECokleisli$fSemigroupoidTYPEKleisli$fSemigroupoidTYPE(,)$fSemigroupoidTYPE(->)DualgetDual$fCategorykDual$fSemigroupoidkDualGroupoidinv$fGroupoidkDualIsoembedproject$fCategorykIso$fGroupoidkIso$fSemigroupoidkIsoObsemiid $fObTYPE(->)a$fObTYPECokleislia$fObTYPEKleislia bitraverse1_bifor1_ bisequenceA1_bifoldMapDefault1 $fFunctorAct$fSemigroupActAltsomemany $fAltReverse $fAltProduct $fAltLift $fAltCompose$fAltBackwards $fAltRWST $fAltRWST0 $fAltWriterT $fAltWriterT0 $fAltStateT $fAltStateT0 $fAltListT $fAltExceptT $fAltErrorT $fAltMaybeT $fAltReaderT$fAltIdentityT$fAltWrappedApplicative $fAltNonEmpty$fAltSeq $fAltIntMap$fAltMap$fAltWrappedArrow$fAltWrappedMonad $fAltOption $fAltMaybe$fAlt[]$fAltIO $fAltEither $fAltProxy$fAltV1$fAltU1 $fAltRec1$fAltM1$fAlt:*:Pluszero $fPlusReverse $fPlusProduct $fPlusLift $fPlusCompose$fPlusBackwards $fPlusRWST $fPlusRWST0 $fPlusWriterT$fPlusWriterT0 $fPlusStateT $fPlusStateT0 $fPlusListT $fPlusExceptT $fPlusErrorT $fPlusMaybeT $fPlusReaderT$fPlusIdentityT$fPlusWrappedApplicative $fPlusSeq $fPlusIntMap $fPlusMap$fPlusWrappedArrow$fPlusWrappedMonad $fPlusOption $fPlusMaybe$fPlus[]$fPlusIO $fPlusRec1$fPlusM1 $fPlus:*:$fPlusU1 $fPlusProxyStatic runStatic$fArrowChoiceStatic$fArrowPlusStatic$fArrowZeroStatic $fArrowStatic$fCategoryTYPEStatic$fSemigroupoidTYPEStatic$fComonadStatic$fExtendStatic$fApplicativeStatic $fPlusStatic $fAltStatic $fApplyStatic$fFunctorStatic intercalate1intercalateMap1 traverse1_for1_ sequenceA1_foldMapDefault1asum1foldrM1foldlM1$fSemigroupAlt_$fSemigroupJoinWith Traversable1 traverse1 sequence1Bitraversable1 bitraverse1 bisequence1$fTraversable1Joker$fTraversable1(,)$fTraversable1NonEmpty$fTraversable1Tree$fTraversable1Tagged$fTraversable1Complex$fTraversable1Sum$fTraversable1Reverse$fTraversable1Product$fTraversable1Lift$fTraversable1Compose$fTraversable1Backwards$fTraversable1IdentityT$fTraversable1Identity$fTraversable1:.:$fTraversable1:+:$fTraversable1:*:$fTraversable1V1$fTraversable1Par1$fTraversable1M1$fTraversable1Rec1 $fBitraversable1WrappedBifunctor$fBitraversable1Tannen$fBitraversable1Product$fBitraversable1Joker$fTraversable1Join$fBitraversable1Flip$fBitraversable1Clown$fBitraversable1Biff$fBitraversable1Tagged$fBitraversable1Const$fBitraversable1(,,,,)$fBitraversable1(,,,)$fBitraversable1(,,)$fBitraversable1(,)$fBitraversable1Either$fBitraversable1ArgbifoldMap1DefaultfoldMap1Default<<..>>bilift2bilift3constControl.CategoryidMonadreturn Applicativepure.3unordered-containers-0.2.8.0-9vyhLlLaqmyDfOnbawvdcQData.HashMap.BaseHashMapcontainers-0.5.7.1Data.IntMap.BaseIntMap Data.Map.BaseMapCategoryActgetActignore Alternative<|>Maybeghc-prim GHC.TypesIO Data.EitherEithertransformers-0.5.2.0Control.Monad.Trans.ErrorErrorTMagicrunMagicemptyAlt_getAlt_JoinWithjoinee