-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Type-safe unconstrained dynamic typing
--   
--   A library of monadic typed keys which can be compared for equality,
--   returning an equality proof if equal. See
--   <a>http://dx.doi.org/10.1145/2976002.2976008</a> The authors of the
--   cited document and of this package are disjoint.
@package key
@version 0.1.2.0

module Control.Monad.Trans.Key
data Key s a
newKey :: Applicative p => KeyringT s p (Key s a)
type Keyring s = KeyringT s Identity
unKeyring :: (forall s. Keyring s a) -> a
data KeyringT s f a
unKeyringT :: (forall s. KeyringT s f a) -> f a
lift :: f a -> KeyringT s f a
instance forall k (s :: k). Control.Monad.Trans.Class.MonadTrans (Control.Monad.Trans.Key.KeyringT s)
instance forall k (s :: k) (f :: * -> *). Control.Monad.Fail.MonadFail f => Control.Monad.Fail.MonadFail (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). Control.Monad.Fix.MonadFix f => Control.Monad.Fix.MonadFix (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). GHC.Base.MonadPlus f => GHC.Base.MonadPlus (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). GHC.Base.Monad f => GHC.Base.Monad (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). GHC.Base.Alternative f => GHC.Base.Alternative (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). GHC.Base.Applicative f => GHC.Base.Applicative (Control.Monad.Trans.Key.KeyringT s f)
instance forall k (s :: k) (f :: * -> *). GHC.Base.Functor f => GHC.Base.Functor (Control.Monad.Trans.Key.KeyringT s f)
instance forall k1 k2 (s :: k2). Data.Type.Equality.TestEquality (Control.Monad.Trans.Key.Key s)