_kl      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%& ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F GHIJKLMNOPQ R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k NoneAAn ordered list. The semigroup instance merges two lists so that ( the result remains in ascending order. KThe dual of a monoid is the same as the original, with arguments reversed The Max monoid, where  (+) =~ max FA monoid on Maybes, where the sum is the leftmost non-Nothing value. 6A monoid on category endomorphisms under composition The Product monoid &6A monoid is a semigroup with a null element such that zero + a == a + zero == a (MThe class of all types that have a binary operation. Note that the operation isn'=t necesarily commutative (in the case of lists, for example) v  !"#$%&'()*+,-./0123456789:;<=>?@Almnopqrstuvwxyz{|}~       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm  !"#$%&'()*+,-./0123456789:;<=>?@A@,+*-()$%&'!"#   ./2;1<43675:=>?89@0A^    !"#$%&'()*+,-./0123456789:;<=>?@Almnopqrstuvwxyz{|}~NoneBCDEFGHBCDEFGHBCDEFGHNoneIThe Composition functor LA motherflippin' functor OThe Constant Functor RThe Identity Functor 8nopqrsIJKLMNOPQRSTUVWXYZ[\]^_`abtuvwxyz{|}~GHIJKLMNOPQRSTUVWXYZ[\]^_`abGHWXUVRSTOPQLMNIJKYZ\[_]^b`a*nopqrsIJKLMNOPQRSTUVWXYZ[\]^_`abtuvwxyz{|}~None#cdefghijklmnopqrstuvwxyz{|}cdefghijklmnopqrstuvwxyz{|}fgcdehijklmnopqrstuvwxyz{|} cdefghijklmnopqrstuvwxyz{|}None~NA wrapper for applicative functors with actions executed in the reverse order The Tree equivalent to ZipList GA wrapper type for lists with zipping Applicative instances, such that ZipList [f1,...,fn] F ZipList [x1,...,xn] == ZipList [f1 x1,...,fn xn] 4~6EFGHIJKLMNOPQRSTUVWXYZ[\]^_`abr~EF~r/~None Create an  from two inverse functions.  Reverse an    from ::  a b ->  b a  Create a $ from a getter and setter function.  & lens :: (a -> b) -> (a -> b -> a) ->  a b  Create a * from a maybe getter and setter function.  - prism :: (a -> (a:+:b)) -> (a -> b -> a) ->  a b *Retrieve a value from a structure using a  (or ) !_promapping :: Bifunctor f => Iso' a b -> Iso' (f a c) (f b c) R99MNoneXEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None-A simple continuation monad implementation A simple Writer monad A simple Reader monad A simple State Monad -The class of all monads that have a fixpoint       !"#$%     BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abr~      !"#$%SBCD      !"#$%      !"#$%      None&'()*+,-./0123456789:&'()*+,-./0123456789:'(&)*+,-./0123456789:&'()*+,-./0123456789: None;<=>?@ABCDEF !"#BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abr~      !"#$%;<=>?@ABCDEF@ACB>?EFD;<=;<=>?@ABCDEF !"#None$%GHIJKLMNOP&'()*+,-./ GHIJKLMNOP JKLGHIMNOP$%GHIJKLMNOP&'()*+,-./None      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abdefghijklm  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%;<=>?@ABCDEF NoneQ>A type wrapper that adds a Bounded instance for types that don't possess one. QRST01234QRSTQTSRQTSR01234 NoneVBA type wrappers for timestamps that can be compared unambiguously 52An action that creates a new value upon each call 65A repeatable action that converges to a single point UV75689:;<WXY=>Z?@ABCDEUVWXYZVWUXYZUV75689:;<WXY=>Z?@ABCDE None[*A Future value (a value with a timestamp) \:An event (a list of time-value pairs of increasing times) _The 'splice' operator. Occurs when a occurs.  at t: a // b = (a,before t: b) `The 'over' operator. Occurs only when a occurs. - at t: a <|*> (bi,b) = a <*> (minBound,bi):b abGroup the occurences of an event by equality. Occurs when the first occurence of a group occurs. fDSinks an action event into the Real World. Each action is executed [FG\HIJKL]^_`abcdefghijMkNOPQRSTQRSTUVWXYZ[\]^_`abcdefghijk\]^cdb_`aefg[hijk[FG\HIJKL]^_`abcdefghijMkNOPQRSTU  !""#$$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWWXYYZ[[\]]^_`abcdefghijklmmnopqrstuvwxyz{|}~      !"#$%&'( ) * * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = = > ? @ A B C D E F GHHIJKLMNOP Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j klmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrqsqtquvwxyz{|}~      !"#$%&'()* + , - . / 0 1 233456789:;<= > ? @ A B C D V E F G H I J K L M N O P Q R [ S \ T U V W X Y Z [ \ ] ^ _` SimpleH-0.9 SimpleH.CoreSimpleH.Containers SimpleH.MonadSimpleH.ApplicativeSimpleH.FunctorSimpleH.Foldable SimpleH.LensSimpleH.TraversableSimpleH.Parser SimpleH.ArrowSimpleH.Reactive.TimeValSimpleH.Reactive.TimeSimpleH.ReactiveSimpleH.ClassesSimpleHbaseData.Ord comparingcontainers-0.5.0.0 Data.Map.BaseMap Data.Set.BaseSet Interleave interleaveOrdList getOrdListDualgetDualMaxgetMaxAccumgetAccumEndorunEndoProduct getProductSplit<#>Choice<|>Categoryid.UnitpureRingone*SubSemicastMonoidzero Semigroup+:+::*:Voidvd<<<>>> insertOrd&+++secondfirstguard ifThenElsebooltailSafeheadDeffailconstfixunitwhenunlessinOrder invertOrdMonadjoin>>= Applicative<*>FunctormapCompose getComposeFlipunFlipConstgetConstIdgetId Bifunctordimap Cofunctorcomap<$>|||<&><$leftrightvoidmap2map3promapSizedgetSizedFoldablefoldfoldMapconvertconcatsumsizecountlengthsplitpartitionEithers partitionfilterselectrefusecomposefoldlfoldrfindorandallanyelem BackwardsforwardsZipTreeZipList getZipListap*><*<**> sequence_ traverse_for_foreverliftAliftA2liftA3liftA4plusAzeroAbetween IsoFunctor2mapIso2 IsoFunctormapIso Isomorphic_isoCompound_each:<->:Iso'Iso Traversal' TraversalGetter'GetterLens'Lens LensLike'LensLikeisofromlensgetterprism^.^..%~%-^?-..-atat'warpset_1_2_l_r_list_head_tail_mapping _promapping_Id_OrdList_Dual_Const_Max_Endo_maybe_Flip_Compose _Backwardswarp2adding_thunk Contravariantcollect Traversablesequencetraverseforeach transposeflipEitherT MonadErrorthrowcatchListT MonadListforkContContTrunContT MonadContcallCCWriterWriterT MonadWritertelllistencensorReaderReaderT MonadReaderasklocalStateStateT MonadStategetputmodifyRWSRWSTrunRWSTKleisli runKleisli MonadTransliftMonadFixmfix_KleislifoldlMfoldrMwhileuntil>>=<<<=<>=><*=return_stateTevalexec_state=-=~getssavingmapAccum mapAccum_ mapAccumR mapAccumR_pushpopwithPrevwithNext_readerT_readermute intercept_writerT_writer evalContTevalCont_listTtryeitherT runEitherTParserParserT_ParserT_parserT_parser remainingtokenmanymany1satisfysingleseveraloptioneoisepBy1sepBy<+>oneOfnoneOfchainListArunListAApplyapplyArrowarr^>>>>^dupcomapAappAListgetAListDataMaplookupaltermemberdeleteminsertinsertTimeValNeverSinceAlwaysSecondsTimetimeValtimeIOwaitTill currentTimeFutureEvent_eventatTimes//<|*>groupE mapFutureswithTimetimesmasksinkevent_future_time_valuefutureIO$fSemigroupInterleave$fSemigroupOrdList $fRingDual$fSemigroupDual $fMonoidMax$fSemigroupMax $fUnitAccum $fMonoidAccum$fSemigroupAccum $fMonoidEndo$fSemigroupEndo$fMonoidProduct$fSemigroupProduct $fSplit(->) $fChoice(->)$fCategory(->)$fUnitIO $fUnitTree$fUnit[] $fUnit(->) $fUnit(,) $fUnitMaybe $fUnitEither$fRing[] $fRingDouble $fRingFloat $fRingInteger $fRingInt $fRingBool$fSubSemiaVoid $fSubSemia() $fMonoidMaybe $fMonoidBool$fMonoidEither $fMonoid(,,) $fMonoid(,) $fMonoid[]$fMonoidDouble $fMonoidFloat$fMonoidInteger $fMonoidInt $fMonoid() $fMonoidVoid$fSemigroupMaybe$fSemigroupEither$fSemigroup(,,)$fSemigroup(,) $fSemigroup[]$fSemigroupInteger$fSemigroupDouble$fSemigroupFloat$fSemigroupInt$fSemigroupBool $fSemigroup()$fSemigroupVoidGHC.Errerrorghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.TuplefstsndGHC.Base otherwise$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negate fromIntegral realToFrac toInteger toRationalBoundedEnumEq GHC.FloatFloating FractionalIntegralNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIO Data.EitherEitherStringFalseTrueLeftRightLTEQGTPrelude$!readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.ExceptionioError Text.Readreadreadseither Data.Listunwordswordsunlineslinesproductfoldl1minimummaximumlex readParenreadList readsPrecText.ParserCombinators.ReadPReadSacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadixGHC.IOFilePath userErrorIOErrorlcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFraction undefinedmaxBoundminBoundfromEnumtoEnumpredsucc showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!! concatMapnotElemreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrfoldr1scanl1scanlnullinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabsasTypeOf/=compare<=&&||not<>maxminSumgetSumFProdgetFProd $fMonadIO$fApplicativeIO $fFunctorIO $fFunctor(->) $fFunctor(,)$fFunctorMaybe$fFunctorEither $fFunctorSum$fFunctorFProd$fFunctorCompose $fUnitCompose$fApplicativeConst $fUnitConst$fFunctorConst$fSemigroupConst $fMonadId$fApplicativeId $fFunctorId$fUnitId $fFunctorTree $fFunctor[]$fBifunctor(->)$fCofunctorFlip$fCofunctorCompose$fSubSeminSized$fFoldableCompose$fFoldableTree $fFoldable[] $fFoldable(,)$fFoldableMaybe$fFoldableEither $fFoldableIdoneAtimesA$fMonoidCompose$fSemigroupCompose$fApplicativeBackwards$fApplicativeZipTree $fUnitZipTree$fFunctorZipTree$fApplicativeZipList $fUnitZipList$fFunctorZipList$fMonoidZipList$fSemigroupZipList$fMonadInterleave$fApplicativeInterleave$fApplicativeCompose $fMonadTree$fApplicativeTree $fMonad[]$fApplicative[] $fMonad(,)$fApplicative(,) $fMonad(->) $fRing(->) $fMonoid(->)$fSemigroup(->)$fApplicative(->) $fMonadEither$fApplicativeEitherIsoTisoTunIsoTswapE_Accum$fIsoFunctor2Either$fIsoFunctor2(,)$fIsoFunctor2(->)$fIsoFunctor(->)$fIsomorphicab(,)(,)$fIsomorphicff'ComposeCompose$fIsomorphicBoolBoolMaybeMaybe$fIsomorphicffFlipFlip$fIsomorphickkEndoEndo$fIsomorphicabMaxMax$fIsomorphicabDualDual$fIsomorphicabConstConst$fIsomorphic[][]OrdListOrdList$fIsomorphicabIdId$fCompoundab(,,)(,,)$fCompoundab(,)(,)$fBifunctorIsoT $fFunctorIsoT$fCompoundab[][]$fContravariant(->)$fContravariantId$fTraversableCompose$fTraversableTree$fTraversable[]$fTraversableEither$fTraversable(,) MonadInternalinternalcfixmfixingfolding_RWSTget_put_modify__StateTask_local_tell_listen_censor_$fMonadErroreIO$fMonadErrorVoidMaybe $fMonadMaybe$fApplicativeMaybe$fMonadErrorVoid[]$fMonadErroreEither$fMonadErrorVoidListT$fMonadWriterwListT$fMonadStatesListT$fMonadTransListT$fMonadFixListT$fMonadListListT $fMonadList[]$fMonadBackwards$fMonadTransBackwards$fMonadContContT$fMonadTransContT $fMonadContT$fApplicativeContT$fFunctorContT $fUnitContT$fMonadStaterWriterT$fMonadReaderrWriterT$fMonadWriterw(,)$fMonadWriterwReaderT$fMonadStatesReaderT$fMonadReaderr(->)$fMonadWriterwStateT$fMonadReaderrStateT$fMonadInternalRWST$fMonadTransRWST$fMonadErroreRWST$fTraversableRWST$fFoldableRWST$fMonadWriterwRWST$fMonadReaderrRWST$fMonadStatesRWST$fMonadContRWST$fMonadFixRWST $fMonadRWST$fApplicativeRWST $fFunctorRWST $fUnitRWST"$fIsomorphic(->)(->)KleisliKleisli$fSplitKleisli$fChoiceKleisli$fCategoryKleisli$fMonadFixCompose $fMonadFixIO$fMonadFixEither $fMonadFix[]$fMonadFix(->) $fMonadFixId$fMonadCompose $fArrowListA $fSplitListA $fChoiceListA$fCategoryListA$fArrowKleisli$fApplyKleisli $fApply(->) $fArrow(->)Bimap_inverse$fDataMapFlipba$fDataMapBimapab $fFunctorMap $fMonoidMap$fSemigroupMap $fMonoidSet$fSemigroupSet$fDataMapMapka$fDataMapSetaVoid$fBoundedTimeVal$fMonadTimeVal$fApplicativeTimeVal $fUnitTimeVal$fFunctorTimeValNewImprovePartCmpMinMax mergeTimesByisPoint tillPointforkAtseconds $fUnitTime $fBoundedTime $fMonoidTime$fSemigroupTime $fOrdTime$fEqTime $fShowTimeEventRepgetEvent pureEithersequenceEither_EventcmpFut $fOrdFuture $fEqFuture $fMonadEvent$fApplicativeEvent $fMonoidEvent$fSemigroupEvent $fShowEvent