h      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg(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> provisionalportableSafe"  !"#$%&'()*+      !"#$%&'()*+(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe- Iduplicated = extended id fmap (fmap f) . duplicated = duplicated . fmap f. !extended f = fmap f . duplicated,-./0123456789:;<,-.,-.,-./0123456789:;<(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe ? a L b "a h i  a K b @ a M b "a h  a K b AA j sans k.Minimal definition: Either C or BNIf 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)D7Transform a Apply into an Applicative by adding a unit.GWrap an l to be used as a member of JJBA strong lax semi-monoidal endofunctor. This is equivalent to an l without m.Laws: (n)  u K v K w = u K (v K w) x K (f  y) = (n f)  x K y f  (x K y) = (f n)  x K y The laws imply that L and M really ignore their left and right results, respectively, and really return their right and left results, respectively. Specifically, (mf  m) L (nf  n) = nf  (m L n) (mf  m) M (nf  n) = mf  (m M n) L  a L b = h i  a K bM  a M b = h  a K baAn o is not a j, but it is an instance of AbA p is not a j, but it is an instance of AAn IntMap is not l, but it is an instance of J A Map is not l, but it is an instance of Jo=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~=>@?ACBDEFGHIJKMLNOJKLMGHIDEFABCON=>?@c=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~>4?4@4B1K4L4M4(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe A variant of K with the arguments reversed.2Lift a binary function into a comonad with zipping3Lift a ternary function into a comonad with zippingDEFGHIJKMLJKLMGHIDEF4(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 qrst  qrst(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeACBDEFGHIJKMLNOJKLMGHIDEFABCON111(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe<Laws: <!> is associative: (a <!> b) <!> c = a <!> (b <!> c) <$> left-distributes over <!>: f <$> (a <!> b) = (f <$> a) <!> (f <$> b)If extended to an u then  should equal v.Ideally, an instance of I also satisfies the "left distributon" law of MonadPlus with respect to K: I<.> right-distributes over <!>: (a <!> b) <.> c = (a <.> c) <!> (b <.> c)But w, x, y a, z 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 A or j@ 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)v without a required empty-This instance does not actually satisfy the (K3) right distributive law It instead satisfies the  Left-Catch law!DEFGHIJKML3 (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe Insert an m- between each pair of 't m'. Equivalent to  with { as the second argument.4intercalate1 ", " $ "hello" :| ["how", "are", "you"]"hello, how, are, you"!intercalate1 ", " $ "hello" :| []"hello"3intercalate1 mempty $ "I" :| ["Am", "Fine", "You?"] "IAmFineYou?"Insert 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|}~  |}~ (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe" (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe1A subset of monad transformers can transform any A as well.             (C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafeLaws: zero <!> m = m m <!> zero = mIf extended to an u then  should equal . !"#$%&'()*+,-./DEFGHIJKML !"#$%&'()*+,-./(C) 2007-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe+D6 sans i? Ahttp://en.wikipedia.org/wiki/Band_(mathematics)#Rectangular_bands0123456789:;<=>?@0123456767345012 0123456789:;<=>?@(C) 2007-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe+DABCDEABCABCABCDE(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafe+9;DFsemigroupoid with inverses. This technically should be a category with inverses, except we need to use Ob to define the valid objects for the categoryFGHFGFGFGH(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafe+DIJKLMNOIJKLIJKLIJKLMNO(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisional polykindsSafePQRSTUVWXYZ[\]^_PQRPQRPQRSTUVWXYZ[\]^_(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> experimentalnon-portable (flexible MPTCs)Safe+9:;<=D`abcd`a`adcb`abcd(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafefLift binary functionsgLift ternary functionsefg  =>@?efg =>?@ efgefge4 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_``abcdefghijklmnopqrstuvwxyz{|}~                                   ! " # $ % & ' ( ) * +,-./0123456789:;<=>?@ABCDEFGHIIJKLMNOPQRSTUVWXYYZ[\]^_``abcdeffghijklmnopqrstuvwxyz{|}~~         ~(semigroupoids-5.1-AGsfbyOC3qrARMwJttpTTTData.Functor.ApplyData.Bifunctor.ApplyData.Semigroup.Foldable.ClassData.Functor.ExtendData.Functor.BindData.Functor.Bind.ClassData.Semigroup.BifoldableData.Functor.AltData.Semigroup.Foldable Data.Semigroup.Traversable.ClassData.Semigroup.BitraversableData.Semigroup.TraversableData.Functor.Bind.TransData.Functor.PlusData.SemigroupoidData.Semigroupoid.Dual Data.GroupoidData.IsomorphismData.Semigroupoid.StaticData.Semigroupoid.ObData.Traversable.InstancesbaseGHC.BasefmapFunctorData.Bifunctorsecondfirstbimap Bifunctor Data.Functor$><$><$%bifunctors-5.3-GuIXKlkt10S2UKZmcg2qbzData.Biapplicative<<$>> Bifoldable1bifold1 bifoldMap1 Foldable1fold1foldMap1$fFoldable1Joker$fFoldable1(,)$fFoldable1NonEmpty$fFoldable1Sum$fFoldable1Reverse$fFoldable1Product$fFoldable1Lift$fFoldable1Compose$fFoldable1Backwards$fFoldable1IdentityT$fFoldable1Identity$fFoldable1Tree$fBifoldable1WrappedBifunctor$fBifoldable1Tannen$fBifoldable1Product$fBifoldable1Joker$fFoldable1Join$fBifoldable1Flip$fBifoldable1Clown$fBifoldable1Biff$fBifoldable1Tagged$fBifoldable1Const$fBifoldable1(,,,,)$fBifoldable1(,,,)$fBifoldable1(,,)$fBifoldable1(,)$fBifoldable1Either$fBifoldable1ArgExtend duplicatedextended $fExtendSum$fExtendNonEmpty$fExtendIdentityT$fExtendIdentity$fExtendTracedT$fExtendStoreT $fExtendEnvT $fExtendTree $fExtendSeq $fExtend(->) $fExtend(,)$fExtendEither $fExtendMaybe $fExtend[]Biapply<<.>>.>><<.Bind>>-join MaybeApply runMaybeApplyWrappedApplicativeWrapApplicativeunwrapApplicativeApply<.>.><. returning apDefault$fBiapplyWrappedBifunctor$fBiapplyTannen$fBiapplyProduct $fApplyJoin$fBiapplyJoker $fBiapplyFlip$fBiapplyClown $fBiapplyBiff$fBiapplyTagged$fBiapplyConst$fBiapply(,,,,)$fBiapply(,,,) $fBiapply(,,) $fBiapplyArg $fBiapply(,) $fBindTree $fBindSeq $fBindIntMap $fBindMap $fBindContT $fBindRWST $fBindRWST0 $fBindStateT $fBindStateT0 $fBindWriterT$fBindWriterT0 $fBindReaderT $fBindExceptT $fBindErrorT $fBindListT $fBindMaybeT$fBindWrappedMonad$fBindIdentityT$fBindIdentity $fBindOption $fBindMaybe$fBindIO$fBindNonEmpty$fBind[] $fBind(->) $fBindProduct $fBindEither $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 $fApplyTree $fApplySeq $fApplyIntMap $fApplyMap$fApplyWrappedArrow$fApplyWrappedMonad$fApplyIdentityT$fApplyIdentity $fApplyOption $fApplyMaybe $fApplyIO $fApply[]$fApplyZipList $fApply(->) $fApplyConst $fApplyEither$fApplyNonEmpty $fApply(,)$fApplyReverse$fApplyProduct $fApplyLift$fApplyConstant$fApplyCompose$fApplyBackwards<..>liftF2liftF3 bitraverse1_bifor1_ bisequenceA1_bifoldMapDefault1 $fFunctorAct$fSemigroupAct-<<->--<-Altsomemany $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 intercalate1intercalateMap1 traverse1_for1_ sequenceA1_foldMapDefault1asum1$fSemigroupAlt_$fSemigroupJoinWith Traversable1 traverse1 sequence1Bitraversable1 bitraverse1 bisequence1$fTraversable1Joker$fTraversable1(,)$fTraversable1NonEmpty$fTraversable1Tree$fTraversable1Sum$fTraversable1Reverse$fTraversable1Product$fTraversable1Lift$fTraversable1Compose$fTraversable1Backwards$fTraversable1IdentityT$fTraversable1Identity $fBitraversable1WrappedBifunctor$fBitraversable1Tannen$fBitraversable1Product$fBitraversable1Joker$fTraversable1Join$fBitraversable1Flip$fBitraversable1Clown$fBitraversable1Biff$fBitraversable1Tagged$fBitraversable1Const$fBitraversable1(,,,,)$fBitraversable1(,,,)$fBitraversable1(,,)$fBitraversable1(,)$fBitraversable1Either$fBitraversable1ArgbifoldMap1DefaultfoldMap1Default BindTransliftB$fBindTransContT$fBindTransRWST$fBindTransRWST0$fBindTransStateT$fBindTransStateT0$fBindTransWriterT$fBindTransWriterT0$fBindTransReaderT$fBindTransIdentityTPluszero $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[]$fPlusIOSemigetSemiWrappedCategory WrapCategoryunwrapCategory Semigroupoido$fCategorykSemi$fSemigroupoidkSemi$fCategorykWrappedCategory$fSemigroupoidkWrappedCategory$fSemigroupoidTYPEOp$fSemigroupoidTYPECokleisli$fSemigroupoidTYPEKleisli$fSemigroupoidTYPE(,)$fSemigroupoidTYPE(->)DualgetDual$fCategorykDual$fSemigroupoidkDualGroupoidinv$fGroupoidkDualIsoembedproject$fCategorykIso$fGroupoidkIso$fSemigroupoidkIsoStatic runStatic$fArrowChoiceStatic$fArrowPlusStatic$fArrowZeroStatic $fArrowStatic$fCategoryTYPEStatic$fSemigroupoidTYPEStatic$fComonadStatic$fExtendStatic$fApplicativeStatic $fPlusStatic $fAltStatic $fApplyStatic$fFunctorStaticObsemiid $fObTYPE(->)a$fObTYPECokleislia$fObTYPEKleislia<<..>>bilift2bilift3constControl.CategoryidMonadreturn Applicativepure.containers-0.5.7.1Data.IntMap.BaseIntMap Data.Map.BaseMapActgetActignore Alternative<|>Maybeghc-prim GHC.TypesIO Data.EitherEithertransformers-0.5.2.0Control.Monad.Trans.ErrorErrorTAlt_getAlt_JoinWithjoineeemptyCategory