{-# LANGUAGE QuantifiedConstraints, UndecidableInstances #-} module Control.Monad.Trans.Control.Default ( Stack0T (..) , Stack2T (..) ) where import Control.Monad.Base import Control.Monad.Trans import Control.Monad.Trans.Control import Data.Kind newtype Stack0T (m :: Type -> Type) (a :: Type) = Stack0T { Stack0T m a -> m a unStack0T :: m a } deriving (Functor (Stack0T m) a -> Stack0T m a Functor (Stack0T m) -> (forall a. a -> Stack0T m a) -> (forall a b. Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b) -> (forall a b c. (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c) -> (forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b) -> (forall a b. Stack0T m a -> Stack0T m b -> Stack0T m a) -> Applicative (Stack0T m) Stack0T m a -> Stack0T m b -> Stack0T m b Stack0T m a -> Stack0T m b -> Stack0T m a Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c forall a. a -> Stack0T m a forall a b. Stack0T m a -> Stack0T m b -> Stack0T m a forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b forall a b. Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b forall a b c. (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c forall (f :: * -> *). Functor f -> (forall a. a -> f a) -> (forall a b. f (a -> b) -> f a -> f b) -> (forall a b c. (a -> b -> c) -> f a -> f b -> f c) -> (forall a b. f a -> f b -> f b) -> (forall a b. f a -> f b -> f a) -> Applicative f forall (m :: * -> *). Applicative m => Functor (Stack0T m) forall (m :: * -> *) a. Applicative m => a -> Stack0T m a forall (m :: * -> *) a b. Applicative m => Stack0T m a -> Stack0T m b -> Stack0T m a forall (m :: * -> *) a b. Applicative m => Stack0T m a -> Stack0T m b -> Stack0T m b forall (m :: * -> *) a b. Applicative m => Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b forall (m :: * -> *) a b c. Applicative m => (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c <* :: Stack0T m a -> Stack0T m b -> Stack0T m a $c<* :: forall (m :: * -> *) a b. Applicative m => Stack0T m a -> Stack0T m b -> Stack0T m a *> :: Stack0T m a -> Stack0T m b -> Stack0T m b $c*> :: forall (m :: * -> *) a b. Applicative m => Stack0T m a -> Stack0T m b -> Stack0T m b liftA2 :: (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c $cliftA2 :: forall (m :: * -> *) a b c. Applicative m => (a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c <*> :: Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b $c<*> :: forall (m :: * -> *) a b. Applicative m => Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b pure :: a -> Stack0T m a $cpure :: forall (m :: * -> *) a. Applicative m => a -> Stack0T m a $cp1Applicative :: forall (m :: * -> *). Applicative m => Functor (Stack0T m) Applicative, a -> Stack0T m b -> Stack0T m a (a -> b) -> Stack0T m a -> Stack0T m b (forall a b. (a -> b) -> Stack0T m a -> Stack0T m b) -> (forall a b. a -> Stack0T m b -> Stack0T m a) -> Functor (Stack0T m) forall a b. a -> Stack0T m b -> Stack0T m a forall a b. (a -> b) -> Stack0T m a -> Stack0T m b forall (m :: * -> *) a b. Functor m => a -> Stack0T m b -> Stack0T m a forall (m :: * -> *) a b. Functor m => (a -> b) -> Stack0T m a -> Stack0T m b forall (f :: * -> *). (forall a b. (a -> b) -> f a -> f b) -> (forall a b. a -> f b -> f a) -> Functor f <$ :: a -> Stack0T m b -> Stack0T m a $c<$ :: forall (m :: * -> *) a b. Functor m => a -> Stack0T m b -> Stack0T m a fmap :: (a -> b) -> Stack0T m a -> Stack0T m b $cfmap :: forall (m :: * -> *) a b. Functor m => (a -> b) -> Stack0T m a -> Stack0T m b Functor, Applicative (Stack0T m) a -> Stack0T m a Applicative (Stack0T m) -> (forall a b. Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b) -> (forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b) -> (forall a. a -> Stack0T m a) -> Monad (Stack0T m) Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b Stack0T m a -> Stack0T m b -> Stack0T m b forall a. a -> Stack0T m a forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b forall a b. Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b forall (m :: * -> *). Monad m => Applicative (Stack0T m) forall (m :: * -> *) a. Monad m => a -> Stack0T m a forall (m :: * -> *) a b. Monad m => Stack0T m a -> Stack0T m b -> Stack0T m b forall (m :: * -> *) a b. Monad m => Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b forall (m :: * -> *). Applicative m -> (forall a b. m a -> (a -> m b) -> m b) -> (forall a b. m a -> m b -> m b) -> (forall a. a -> m a) -> Monad m return :: a -> Stack0T m a $creturn :: forall (m :: * -> *) a. Monad m => a -> Stack0T m a >> :: Stack0T m a -> Stack0T m b -> Stack0T m b $c>> :: forall (m :: * -> *) a b. Monad m => Stack0T m a -> Stack0T m b -> Stack0T m b >>= :: Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b $c>>= :: forall (m :: * -> *) a b. Monad m => Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b $cp1Monad :: forall (m :: * -> *). Monad m => Applicative (Stack0T m) Monad, MonadBase b, MonadBaseControl b) instance MonadTrans Stack0T where lift :: m a -> Stack0T m a lift = m a -> Stack0T m a forall (m :: * -> *) a. m a -> Stack0T m a Stack0T instance MonadTransControl Stack0T where type StT Stack0T a = a liftWith :: (Run Stack0T -> m a) -> Stack0T m a liftWith Run Stack0T -> m a f = m a -> Stack0T m a forall (m :: * -> *) a. m a -> Stack0T m a Stack0T (m a -> Stack0T m a) -> m a -> Stack0T m a forall a b. (a -> b) -> a -> b $ Run Stack0T -> m a f Run Stack0T forall (m :: * -> *) a. Stack0T m a -> m a unStack0T restoreT :: m (StT Stack0T a) -> Stack0T m a restoreT = m (StT Stack0T a) -> Stack0T m a forall (m :: * -> *) a. m a -> Stack0T m a Stack0T newtype Stack2T (t1 :: (Type -> Type) -> Type -> Type) (t2 :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) (a :: Type) = Stack2T { Stack2T t1 t2 m a -> t1 (t2 m) a unStack2T :: t1 (t2 m) a } deriving (Functor (Stack2T t1 t2 m) a -> Stack2T t1 t2 m a Functor (Stack2T t1 t2 m) -> (forall a. a -> Stack2T t1 t2 m a) -> (forall a b. Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b) -> (forall a b c. (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c) -> (forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b) -> (forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a) -> Applicative (Stack2T t1 t2 m) Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c forall a. a -> Stack2T t1 t2 m a forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b forall a b. Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b forall a b c. (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c forall (f :: * -> *). Functor f -> (forall a. a -> f a) -> (forall a b. f (a -> b) -> f a -> f b) -> (forall a b c. (a -> b -> c) -> f a -> f b -> f c) -> (forall a b. f a -> f b -> f b) -> (forall a b. f a -> f b -> f a) -> Applicative f forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *). Applicative (t1 (t2 m)) => Functor (Stack2T t1 t2 m) forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. Applicative (t1 (t2 m)) => a -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b c. Applicative (t1 (t2 m)) => (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c <* :: Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a $c<* :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a *> :: Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b $c*> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b liftA2 :: (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c $cliftA2 :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b c. Applicative (t1 (t2 m)) => (a -> b -> c) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c <*> :: Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b $c<*> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Applicative (t1 (t2 m)) => Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b pure :: a -> Stack2T t1 t2 m a $cpure :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. Applicative (t1 (t2 m)) => a -> Stack2T t1 t2 m a $cp1Applicative :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *). Applicative (t1 (t2 m)) => Functor (Stack2T t1 t2 m) Applicative, a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b (forall a b. (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b) -> (forall a b. a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a) -> Functor (Stack2T t1 t2 m) forall a b. a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a forall a b. (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b forall (f :: * -> *). (forall a b. (a -> b) -> f a -> f b) -> (forall a b. a -> f b -> f a) -> Functor f forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Functor (t1 (t2 m)) => a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Functor (t1 (t2 m)) => (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b <$ :: a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a $c<$ :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Functor (t1 (t2 m)) => a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a fmap :: (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b $cfmap :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Functor (t1 (t2 m)) => (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b Functor, Applicative (Stack2T t1 t2 m) a -> Stack2T t1 t2 m a Applicative (Stack2T t1 t2 m) -> (forall a b. Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b) -> (forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b) -> (forall a. a -> Stack2T t1 t2 m a) -> Monad (Stack2T t1 t2 m) Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b forall a. a -> Stack2T t1 t2 m a forall a b. Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b forall a b. Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b forall (m :: * -> *). Applicative m -> (forall a b. m a -> (a -> m b) -> m b) -> (forall a b. m a -> m b -> m b) -> (forall a. a -> m a) -> Monad m forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *). Monad (t1 (t2 m)) => Applicative (Stack2T t1 t2 m) forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. Monad (t1 (t2 m)) => a -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Monad (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Monad (t1 (t2 m)) => Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b return :: a -> Stack2T t1 t2 m a $creturn :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. Monad (t1 (t2 m)) => a -> Stack2T t1 t2 m a >> :: Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b $c>> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Monad (t1 (t2 m)) => Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m b >>= :: Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b $c>>= :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a b. Monad (t1 (t2 m)) => Stack2T t1 t2 m a -> (a -> Stack2T t1 t2 m b) -> Stack2T t1 t2 m b $cp1Monad :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *). Monad (t1 (t2 m)) => Applicative (Stack2T t1 t2 m) Monad, MonadBase b, MonadBaseControl b) instance (forall m. Monad m => Monad (t2 m), MonadTrans t1, MonadTrans t2) => MonadTrans (Stack2T t1 t2) where lift :: m a -> Stack2T t1 t2 m a lift = t1 (t2 m) a -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. t1 (t2 m) a -> Stack2T t1 t2 m a Stack2T (t1 (t2 m) a -> Stack2T t1 t2 m a) -> (m a -> t1 (t2 m) a) -> m a -> Stack2T t1 t2 m a forall b c a. (b -> c) -> (a -> b) -> a -> c . t2 m a -> t1 (t2 m) a forall (t :: (* -> *) -> * -> *) (m :: * -> *) a. (MonadTrans t, Monad m) => m a -> t m a lift (t2 m a -> t1 (t2 m) a) -> (m a -> t2 m a) -> m a -> t1 (t2 m) a forall b c a. (b -> c) -> (a -> b) -> a -> c . m a -> t2 m a forall (t :: (* -> *) -> * -> *) (m :: * -> *) a. (MonadTrans t, Monad m) => m a -> t m a lift instance (forall m. Monad m => Monad (t2 m), MonadTransControl t1, MonadTransControl t2) => MonadTransControl (Stack2T t1 t2) where type StT (Stack2T t1 t2) a = StT t2 (StT t1 a) liftWith :: (Run (Stack2T t1 t2) -> m a) -> Stack2T t1 t2 m a liftWith Run (Stack2T t1 t2) -> m a f = (forall b. t1 (t2 m) b -> Stack2T t1 t2 m b) -> (forall (o :: * -> *) b. Stack2T t1 t2 o b -> t1 (t2 o) b) -> (RunDefault2 (Stack2T t1 t2) t1 t2 -> m a) -> Stack2T t1 t2 m a forall (m :: * -> *) (n' :: (* -> *) -> * -> *) (n :: (* -> *) -> * -> *) (t :: (* -> *) -> * -> *) a. (Monad m, Monad (n' m), MonadTransControl n, MonadTransControl n') => (forall b. n (n' m) b -> t m b) -> (forall (o :: * -> *) b. t o b -> n (n' o) b) -> (RunDefault2 t n n' -> m a) -> t m a defaultLiftWith2 forall b. t1 (t2 m) b -> Stack2T t1 t2 m b forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. t1 (t2 m) a -> Stack2T t1 t2 m a Stack2T forall (o :: * -> *) b. Stack2T t1 t2 o b -> t1 (t2 o) b forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. Stack2T t1 t2 m a -> t1 (t2 m) a unStack2T ((RunDefault2 (Stack2T t1 t2) t1 t2 -> m a) -> Stack2T t1 t2 m a) -> (RunDefault2 (Stack2T t1 t2) t1 t2 -> m a) -> Stack2T t1 t2 m a forall a b. (a -> b) -> a -> b $ \RunDefault2 (Stack2T t1 t2) t1 t2 x -> Run (Stack2T t1 t2) -> m a f RunDefault2 (Stack2T t1 t2) t1 t2 Run (Stack2T t1 t2) x restoreT :: m (StT (Stack2T t1 t2) a) -> Stack2T t1 t2 m a restoreT = (t1 (t2 m) a -> Stack2T t1 t2 m a) -> m (StT t2 (StT t1 a)) -> Stack2T t1 t2 m a forall (m :: * -> *) (n' :: (* -> *) -> * -> *) (n :: (* -> *) -> * -> *) a (t :: (* -> *) -> * -> *). (Monad m, Monad (n' m), MonadTransControl n, MonadTransControl n') => (n (n' m) a -> t m a) -> m (StT n' (StT n a)) -> t m a defaultRestoreT2 t1 (t2 m) a -> Stack2T t1 t2 m a forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *) (m :: * -> *) a. t1 (t2 m) a -> Stack2T t1 t2 m a Stack2T