Îõ³h$¡      Safe-Inferred ->?ÀÁÂÉÔØÙôØ has-transformersThe transformer stack m contains the transformer t. Explicitly, m = t1 (t2 (t3 ... (tN m)...)), and t is one of these  t1, t2, ...s.has-transformersÍInsert an action of this transformer into an arbitrary position in the stack.This will apply Ó as many times as necessary to insert the action. The higher-rank type involving forall nÊ basically says: "The action to lift must only use the structure of the  transformerÃ, not of a specific monad, and is thus definable for any monad n".has-transformersIf the target transformer t is under a different layer t1,  once and recurse.has-transformersÅIf the transformer is outermost, the action can be inserted as-is.   Safe-Inferred->?ÀÁÂØô Safe-Inferred->?ÀÁÂØôJ   Safe-Inferred->?ÀÁÂØô…   Safe-Inferred->?ÀÁÂØôÂ Safe-Inferred->?ÀÁÂØô           !"#$%&/has-transformers-0.1.0.4-65E5plvuKD15FNoXlVxOHzControl.Monad.Trans.Has.WriterControl.Monad.Trans.Has.AccumControl.Monad.Trans.Has.StateControl.Monad.Trans.Has.ReaderControl.Monad.Trans.Has.ExceptControl.Monad.Trans.Hastransformers-0.5.6.2!Control.Monad.Trans.Writer.Strict runWriterTWriterTControl.Monad.Trans.AccumAccumT Control.Monad.Trans.State.Strict runStateTStateTControl.Monad.Trans.Reader runReaderTReaderTControl.Monad.Trans.ExceptExceptTHasliftH$fHastt1$fHasttHasAccumadd HasExceptthrow HasReaderaskHasStategetput HasWritertellControl.Monad.Trans.Classlift