h&       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno Safe-Inferred "1? Safe-Inferred "1?1 Safe-Inferred "1?gderiving-trans)A newtype wrapper for monad transformers.$Access instances of the inner monad m.Type level arguments: t :: (p -> p) -> p -> pmonad transformerm :: p -> pmonada :: pvalue Safe-Inferred "1?"deriving-transA newtype wrapper around q.This is used in % to encourage the use of &.%deriving-trans;A monad transformer, that passes through all instances via .This cannot be defined as a newtype, because we want all the instances, that are defined for  to work for %."$#%&%&"$# Safe-Inferred "1?!0-deriving-trans5A newtype wrapper for two stacked monad transformers.+Access instances of the intermediate monad (t2 m) , whenever t1 implements r / s / t.Type level arguments: t1 :: (p -> p) -> p -> pouter monad transformert2 :: (p -> p) -> p -> pinner monad transformerm :: p -> pmonada :: pvalue0deriving-trans#Run two stacked monad transformers.This function takes the two individual monad transformer runners as arguments.1deriving-transEquivalent to 0!, but discards the monadic state u. This is a simple approach when your monad transformer stack doesn't carry monadic state. u (- t1 t2) a ~ a This can be used to improve error messages when modifying a monad transformer stack.2deriving-trans OVERLAPPABLE. Elevated to (t2 m).3deriving-trans OVERLAPPABLE. Elevated to (t2 m).4deriving-trans OVERLAPPABLE. Elevated to (t2 m).;deriving-trans Elevated to m.<deriving-transSet by v.=deriving-trans OVERLAPPABLE. Elevated to (t2 m).?deriving-transSet by w.@deriving-transSet by x.Aderiving-transSet by y.Bderiving-transSet by z.Cderiving-transSet by {.Dderiving-transSet by |.Ederiving-trans OVERLAPPABLE. Elevated to (t2 m).Fderiving-transSet by w.Gderiving-transSet by x.Hderiving-transSet by y.Ideriving-transSet by }.Jderiving-transSet by ~.Kderiving-trans OVERLAPPABLE. Elevated to (t2 m).Lderiving-transSet by .Mderiving-trans OVERLAPPABLE. Elevated to (t2 m).Nderiving-transSet by w.Oderiving-transSet by x.Pderiving-transSet by y.Qderiving-trans OVERLAPPABLE. Elevated to (t2 m).Rderiving-transSet by w.Sderiving-transSet by x.Tderiving-transSet by y.Uderiving-transSet by .Vderiving-trans OVERLAPPABLE. Elevated to (t2 m).Wderiving-transSet by .Xderiving-trans OVERLAPPABLE. Elevated to (t2 m).Yderiving-transSet by .Zderiving-trans OVERLAPPABLE. Elevated to (t2 m).[deriving-transSet by .\deriving-trans OVERLAPPABLE. Elevated to (t2 m).]deriving-transSet by .^deriving-trans OVERLAPPABLE. Elevated to (t2 m)._deriving-transSet by .`deriving-trans OVERLAPPABLE. Elevated to (t2 m).aderiving-trans Elevated to m.cderiving-trans Elevated to m.dderiving-trans Elevated to m.deriving-trans Elevated to m.deriving-trans Elevated to m.0deriving-transrun t1deriving-transrun t21deriving-transrun t1deriving-transrun t2-/.01-/.01 Safe-Inferred  ")1?bederiving-trans3A data kind representing a monad transformer stack.:This is basically a type-level list of monad transformers.fderiving-trans an empty monad transformer stackgderiving-trans"add a monad transformer to a stackhderiving-transA data type representing the runner function of a monad transformer stack.This is basically a heterogeneous list of monad transformer runners.h can only be used for monad transformer stacks without monadic state  .ideriving-trans$run an empty monad transformer stackjderiving-trans)run the next monad transformer on a stackkderiving-transAn isomorphism between a e and the corresponding monad transformer, which can be built using -.An additional % will automatically be used at the bottom of the stack. You only have to worry about the semantically relevant transformers.lderiving-transRun a monad transformer stack. This takes a h2 as an argument containing the individual runners.l can only be used for monad transformer stacks without monadic state  .gderiving-transremaining stackderiving-transnext monad transformerjderiving-transrun remaining stackderiving-transrun next monad transformeregfhjiklklhjiegfg1j1 Safe-Inferred "1?mderiving-trans(A flipped type-level infix operator for -.nderiving-transA ped infix operator for 0.oderiving-transA ped infix operator for 1.nderiving-transrun t2deriving-transrun t1oderiving-transrun t2deriving-transrun t1mnomnom1n1o1     !"#$%&'()*+,-./01234567789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~| |||||||||||||deriving-trans-0.7.0.0-inplaceControl.Monad.Trans.Elevator'Control.Monad.Trans.Compose.TransparentControl.Monad.Trans.Compose!Control.Monad.Trans.Compose.Stack!Control.Monad.Trans.Compose.Infix#Control.Monad.Accum.OrphanInstances$Control.Monad.Select.OrphanInstancesControl.Monad.Trans.ControlStTElevatorAscenddescend$fMonadUnliftIOElevator$fMonadResourceElevator$fRandomGenMConstrElevator$fFrozenGenConstElevator$fStatefulGenConstElevator$fPrimMonadElevator$fMonadWriterwElevator$fMonadStatesElevator$fMonadSelectrElevator$fMonadRWSrwsElevator$fMonadReaderrElevator$fMonadErroreElevator$fMonadContElevator$fMonadAccumwElevator$fMonadCatchElevator$fMonadThrowElevator$fMonadZipElevator$fMonadPlusElevator$fMonadIOElevator$fMonadFixElevator$fMonadFailElevator$fAlternativeElevator#$fMonadBaseControlIdentitybElevator$fMonadBaseControlbElevator$fMonadBasebElevator$fApplicativeElevator$fFunctorElevator$fMonadElevator$fMonadTransElevator$fMonadTransControlElevator#$fMonadTransControlIdentityElevatorNoTMkNoTunNoT TransparentTrunTransparentT $fFunctorNoT$fApplicativeNoT $fMonadNoT$fMonadTransNoT$fMonadTransControlNoT$fMonadTransControlIdentityNoTComposeT deComposeT runComposeT runComposeT'$fRandomGenMConstrComposeT$fFrozenGenConstComposeT$fStatefulGenConstComposeT#$fMonadTransControlIdentityComposeT$fMonadTransControlComposeT$fMonadTransComposeT$fApplicativeComposeT$fFunctorComposeT$fMonadComposeT$fMonadUnliftIOComposeT$fMonadResourceComposeT$fMonadResourceComposeT0$fPrimMonadComposeT$fMonadWriterwComposeT$fMonadWriterwComposeT0$fMonadWriterwComposeT1$fMonadWriterwComposeT2$fMonadWriterwComposeT3$fMonadWriterwComposeT4$fMonadWriterwComposeT5$fMonadStatesComposeT$fMonadStatesComposeT0$fMonadStatesComposeT1$fMonadStatesComposeT2$fMonadStatesComposeT3$fMonadStatesComposeT4$fMonadSelectrComposeT$fMonadSelectrComposeT0$fMonadRWSrwsComposeT$fMonadRWSrwsComposeT0$fMonadRWSrwsComposeT1$fMonadRWSrwsComposeT2$fMonadReaderrComposeT$fMonadReaderrComposeT0$fMonadReaderrComposeT1$fMonadReaderrComposeT2$fMonadReaderrComposeT3$fMonadErroreComposeT$fMonadErroreComposeT0$fMonadContComposeT$fMonadContComposeT0$fMonadAccumwComposeT$fMonadAccumwComposeT0$fMonadCatchComposeT$fMonadCatchComposeT0$fMonadThrowComposeT$fMonadThrowComposeT0#$fMonadBaseControlIdentitybComposeT$fMonadBaseControlbComposeT$fMonadBasebComposeT$fMonadIOComposeTStackNilT:.|> RunStackTRunNilT:..>StackT runStackT.|>./>..>ghc-prim GHC.TypesType+transformers-0.6.0.4-F8uVRiS1g8K3h8Rsxr0UMdControl.Monad.Trans.Identity IdentityTControl.Monad.Trans.Class MonadTrans,monad-control-1.0.3.1-9k4XD0NyvERHbSFKJZxIuCMonadTransControl4monad-control-identity-0.2.0.0-C96eAiqAq5HPusYxrNzzr$Control.Monad.Trans.Control.IdentityMonadTransControlIdentity&resourcet-1.2.6-GkviYKmTWlu24k3qS4ih9J%Control.Monad.Trans.Resource.Internal ResourceTControl.Monad.Trans.RWS.StrictRWSTControl.Monad.Trans.RWS.LazyControl.Monad.Trans.RWS.CPS!Control.Monad.Trans.Writer.StrictWriterTControl.Monad.Trans.Writer.LazyControl.Monad.Trans.Writer.CPS Control.Monad.Trans.State.StrictStateTControl.Monad.Trans.State.LazyControl.Monad.Trans.SelectSelectTControl.Monad.Trans.ReaderReaderTControl.Monad.Trans.ExceptExceptTControl.Monad.Trans.ContContTControl.Monad.Trans.AccumAccumT(exceptions-0.10.7-LidfE6miSbs6Y1NYj1lBV5Control.Monad.Catch.PureCatchTR:PrimStateComposeTR:StMComposeTabaseGHC.Baseflip