{-# 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 { forall (m :: * -> *) a. Stack0T m a -> m a
unStack0T :: m a }
  deriving (Functor (Stack0T m)
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)
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
$cpure :: forall (m :: * -> *) a. Applicative m => a -> Stack0T m a
pure :: forall a. a -> Stack0T m a
$c<*> :: forall (m :: * -> *) a b.
Applicative m =>
Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b
<*> :: forall a b. Stack0T m (a -> b) -> Stack0T m a -> Stack0T m b
$cliftA2 :: forall (m :: * -> *) a b c.
Applicative m =>
(a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c
liftA2 :: forall a b c.
(a -> b -> c) -> Stack0T m a -> Stack0T m b -> Stack0T m c
$c*> :: forall (m :: * -> *) a b.
Applicative m =>
Stack0T m a -> Stack0T m b -> Stack0T m b
*> :: forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b
$c<* :: forall (m :: * -> *) a b.
Applicative m =>
Stack0T m a -> Stack0T m b -> Stack0T m a
<* :: forall a b. Stack0T m a -> Stack0T m b -> Stack0T m a
Applicative, (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
$cfmap :: forall (m :: * -> *) a b.
Functor m =>
(a -> b) -> Stack0T m a -> Stack0T m b
fmap :: forall a b. (a -> b) -> Stack0T m a -> Stack0T m b
$c<$ :: forall (m :: * -> *) a b.
Functor m =>
a -> Stack0T m b -> Stack0T m a
<$ :: forall a b. a -> Stack0T m b -> Stack0T m a
Functor, Applicative (Stack0T m)
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)
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
$c>>= :: forall (m :: * -> *) a b.
Monad m =>
Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b
>>= :: forall a b. Stack0T m a -> (a -> Stack0T m b) -> Stack0T m b
$c>> :: forall (m :: * -> *) a b.
Monad m =>
Stack0T m a -> Stack0T m b -> Stack0T m b
>> :: forall a b. Stack0T m a -> Stack0T m b -> Stack0T m b
$creturn :: forall (m :: * -> *) a. Monad m => a -> Stack0T m a
return :: forall a. a -> Stack0T m a
Monad, MonadBase b, MonadBaseControl b)

instance MonadTrans Stack0T where
  lift :: forall (m :: * -> *) a. Monad m => 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 :: forall (m :: * -> *) a.
Monad m =>
(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 Stack0T n b -> n b
Stack0T n b -> n (StT Stack0T b)
Run Stack0T
forall (m :: * -> *) a. Stack0T m a -> m a
unStack0T
  restoreT :: forall (m :: * -> *) a. Monad m => m (StT Stack0T a) -> Stack0T m a
restoreT = m a -> Stack0T m a
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 { forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
       (m :: * -> *) a.
Stack2T t1 t2 m a -> t1 (t2 m) a
unStack2T :: t1 (t2 m) a }
  deriving (Functor (Stack2T t1 t2 m)
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)
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
$cpure :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
       (m :: * -> *) a.
Applicative (t1 (t2 m)) =>
a -> Stack2T t1 t2 m a
pure :: forall a. a -> Stack2T t1 t2 m a
$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
<*> :: forall a b.
Stack2T t1 t2 m (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b
$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
liftA2 :: forall a b c.
(a -> b -> c)
-> Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m c
$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
*> :: forall a b.
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 a
<* :: forall a b.
Stack2T t1 t2 m a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a
Applicative, (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
$cfmap :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
       (m :: * -> *) a b.
Functor (t1 (t2 m)) =>
(a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b
fmap :: forall a b. (a -> b) -> Stack2T t1 t2 m a -> Stack2T t1 t2 m b
$c<$ :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
       (m :: * -> *) a b.
Functor (t1 (t2 m)) =>
a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a
<$ :: forall a b. a -> Stack2T t1 t2 m b -> Stack2T t1 t2 m a
Functor, Applicative (Stack2T t1 t2 m)
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)
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
$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
>>= :: forall a 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 -> 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
$creturn :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
       (m :: * -> *) a.
Monad (t1 (t2 m)) =>
a -> Stack2T t1 t2 m a
return :: forall a. a -> Stack2T t1 t2 m a
Monad, MonadBase b, MonadBaseControl b)

instance (forall m. Monad m => Monad (t2 m), MonadTrans t1, MonadTrans t2) => MonadTrans (Stack2T t1 t2) where
  lift :: forall (m :: * -> *) a. Monad m => 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 (m :: * -> *) a. Monad m => m a -> t1 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 (m :: * -> *) a. Monad m => 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 :: forall (m :: * -> *) a.
Monad m =>
(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 t1 (t2 m) b -> Stack2T t1 t2 m b
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 Stack2T t1 t2 o b -> t1 (t2 o) b
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 Stack2T t1 t2 n b -> n (StT t2 (StT t1 b))
Stack2T t1 t2 n b -> n (StT (Stack2T t1 t2) b)
RunDefault2 (Stack2T t1 t2) t1 t2
Run (Stack2T t1 t2)
x
  restoreT :: forall (m :: * -> *) a.
Monad m =>
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