{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE GADTSyntax #-}
{-# LANGUAGE ImportQualifiedPost #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE StandaloneKindSignatures #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE UndecidableSuperClasses #-}
module Control.Monad.Dep.Advice
(
Advice,
makeAdvice,
makeArgsAdvice,
makeExecutionAdvice,
advise,
Ensure,
restrictArgs,
runFinalDepT,
runFromEnv,
deceive,
Top,
And,
All,
NP (..),
I (..),
cfoldMap_NP,
Dict (..),
)
where
import Control.Monad.Dep
import Control.Monad.Trans.Reader (ReaderT(..),withReaderT)
import Data.Kind
import Data.SOP
import Data.SOP.Dict
import Data.SOP.NP
type Advice ::
(Type -> Constraint) ->
((Type -> Type) -> Type) ->
(Type -> Type) ->
Type ->
Type
data Advice ca e_ m r where
Advice ::
forall u ca e_ m r.
Proxy u ->
( forall as.
All ca as =>
NP I as ->
DepT e_ m (u, NP I as)
) ->
( u ->
DepT e_ m r ->
DepT e_ m r
) ->
Advice ca e_ m r
instance Monad m => Semigroup (Advice ca e_ m r) where
Advice Proxy u
outer forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgsOuter u -> DepT e_ m r -> DepT e_ m r
tweakExecutionOuter <> :: Advice ca e_ m r -> Advice ca e_ m r -> Advice ca e_ m r
<> Advice Proxy u
inner forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgsInner u -> DepT e_ m r -> DepT e_ m r
tweakExecutionInner =
let captureExistentials ::
forall ca e_ r outer inner.
Proxy outer ->
( forall as.
All ca as =>
NP I as ->
DepT e_ m (outer, NP I as)
) ->
( outer ->
DepT e_ m r ->
DepT e_ m r
) ->
Proxy inner ->
( forall as.
All ca as =>
NP I as ->
DepT e_ m (inner, NP I as)
) ->
( inner ->
DepT e_ m r ->
DepT e_ m r
) ->
Advice ca e_ m r
captureExistentials :: Proxy outer
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (outer, NP I as))
-> (outer -> DepT e_ m r -> DepT e_ m r)
-> Proxy inner
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (inner, NP I as))
-> (inner -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
captureExistentials Proxy outer
_ forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (outer, NP I as)
tweakArgsOuter' outer -> DepT e_ m r -> DepT e_ m r
tweakExecutionOuter' Proxy inner
_ forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (inner, NP I as)
tweakArgsInner' inner -> DepT e_ m r -> DepT e_ m r
tweakExecutionInner' =
Proxy (Pair outer inner)
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (Pair outer inner, NP I as))
-> (Pair outer inner -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
Advice
(Proxy (Pair outer inner)
forall k (t :: k). Proxy t
Proxy @(Pair outer inner))
( let tweakArgs ::
forall as.
All ca as =>
NP I as ->
DepT e_ m (Pair outer inner, NP I as)
tweakArgs :: NP I as -> DepT e_ m (Pair outer inner, NP I as)
tweakArgs NP I as
args =
do
(outer
uOuter, NP I as
argsOuter) <- NP I as -> DepT e_ m (outer, NP I as)
forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (outer, NP I as)
tweakArgsOuter' @as NP I as
args
(inner
uInner, NP I as
argsInner) <- NP I as -> DepT e_ m (inner, NP I as)
forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (inner, NP I as)
tweakArgsInner' @as NP I as
argsOuter
(Pair outer inner, NP I as)
-> DepT e_ m (Pair outer inner, NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure (outer -> inner -> Pair outer inner
forall a b. a -> b -> Pair a b
Pair outer
uOuter inner
uInner, NP I as
argsInner)
in NP I as -> DepT e_ m (Pair outer inner, NP I as)
forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (Pair outer inner, NP I as)
tweakArgs
)
( let tweakExecution ::
Pair outer inner ->
DepT e_ m r ->
DepT e_ m r
tweakExecution :: Pair outer inner -> DepT e_ m r -> DepT e_ m r
tweakExecution =
( \(Pair outer
uOuter inner
uInner) DepT e_ m r
action ->
outer -> DepT e_ m r -> DepT e_ m r
tweakExecutionOuter' outer
uOuter (inner -> DepT e_ m r -> DepT e_ m r
tweakExecutionInner' inner
uInner DepT e_ m r
action)
)
in Pair outer inner -> DepT e_ m r -> DepT e_ m r
tweakExecution
)
in Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
forall (ca :: * -> Constraint) (e_ :: (* -> *) -> *) r outer inner.
Proxy outer
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (outer, NP I as))
-> (outer -> DepT e_ m r -> DepT e_ m r)
-> Proxy inner
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (inner, NP I as))
-> (inner -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
captureExistentials @ca @e_ Proxy u
outer forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgsOuter u -> DepT e_ m r -> DepT e_ m r
tweakExecutionOuter Proxy u
inner forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgsInner u -> DepT e_ m r -> DepT e_ m r
tweakExecutionInner
instance Monad m => Monoid (Advice ca e_ m r) where
mappend :: Advice ca e_ m r -> Advice ca e_ m r -> Advice ca e_ m r
mappend = Advice ca e_ m r -> Advice ca e_ m r -> Advice ca e_ m r
forall a. Semigroup a => a -> a -> a
(<>)
mempty :: Advice ca e_ m r
mempty = Proxy ()
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m ((), NP I as))
-> (() -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
Advice (Proxy ()
forall k (t :: k). Proxy t
Proxy @()) (\NP I as
args -> ((), NP I as) -> DepT e_ m ((), NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure (NP I as -> ((), NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure NP I as
args)) ((DepT e_ m r -> DepT e_ m r) -> () -> DepT e_ m r -> DepT e_ m r
forall a b. a -> b -> a
const DepT e_ m r -> DepT e_ m r
forall a. a -> a
id)
makeAdvice ::
forall u ca e_ m r.
( forall as.
All ca as =>
NP I as ->
DepT e_ m (u, NP I as)
) ->
( u ->
DepT e_ m r ->
DepT e_ m r
) ->
Advice ca e_ m r
makeAdvice :: (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
makeAdvice = Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
Advice (Proxy u
forall k (t :: k). Proxy t
Proxy @u)
makeArgsAdvice ::
forall ca e_ m r.
Monad m =>
( forall as.
All ca as =>
NP I as ->
DepT e_ m (NP I as)
) ->
Advice ca e_ m r
makeArgsAdvice :: (forall (as :: [*]). All ca as => NP I as -> DepT e_ m (NP I as))
-> Advice ca e_ m r
makeArgsAdvice forall (as :: [*]). All ca as => NP I as -> DepT e_ m (NP I as)
tweakArgs =
(forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m ((), NP I as))
-> (() -> DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
makeAdvice @()
( \NP I as
args -> do
NP I as
args <- NP I as -> DepT e_ m (NP I as)
forall (as :: [*]). All ca as => NP I as -> DepT e_ m (NP I as)
tweakArgs NP I as
args
((), NP I as) -> DepT e_ m ((), NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure ((), NP I as
args)
)
((DepT e_ m r -> DepT e_ m r) -> () -> DepT e_ m r -> DepT e_ m r
forall a b. a -> b -> a
const DepT e_ m r -> DepT e_ m r
forall a. a -> a
id)
makeExecutionAdvice ::
forall ca e_ m r.
Applicative m =>
( DepT e_ m r ->
DepT e_ m r
) ->
Advice ca e_ m r
makeExecutionAdvice :: (DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
makeExecutionAdvice DepT e_ m r -> DepT e_ m r
tweakExecution = (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m ((), NP I as))
-> (() -> DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r) -> Advice ca e_ m r
makeAdvice @() (\NP I as
args -> ((), NP I as) -> DepT e_ m ((), NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure (NP I as -> ((), NP I as)
forall (f :: * -> *) a. Applicative f => a -> f a
pure NP I as
args)) (\() DepT e_ m r
action -> DepT e_ m r -> DepT e_ m r
tweakExecution DepT e_ m r
action)
data Pair a b = Pair !a !b
type Ensure :: ((Type -> Type) -> Type -> Constraint) -> ((Type -> Type) -> Type) -> (Type -> Type) -> Constraint
type Ensure c e_ m = c (DepT e_ m) (e_ (DepT e_ m))
advise ::
forall ca e_ m r as advisee.
(Multicurryable as e_ m r advisee, All ca as, Monad m) =>
Advice ca e_ m r ->
advisee ->
advisee
advise :: Advice ca e_ m r -> advisee -> advisee
advise (Advice Proxy u
_ forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgs u -> DepT e_ m r -> DepT e_ m r
tweakExecution) advisee
advisee = do
let uncurried :: NP I as -> DepT e_ m r
uncurried = advisee -> NP I as -> DepT e_ m r
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
curried -> NP I as -> DepT e_ m r
multiuncurry @as @e_ @m @r advisee
advisee
uncurried' :: NP I as -> DepT e_ m r
uncurried' NP I as
args = do
(u
u, NP I as
args') <- NP I as -> DepT e_ m (u, NP I as)
forall (as :: [*]). All ca as => NP I as -> DepT e_ m (u, NP I as)
tweakArgs NP I as
args
u -> DepT e_ m r -> DepT e_ m r
tweakExecution u
u (NP I as -> DepT e_ m r
uncurried NP I as
args')
in (NP I as -> DepT e_ m r) -> advisee
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
(NP I as -> DepT e_ m r) -> curried
multicurry @as @e_ @m @r NP I as -> DepT e_ m r
uncurried'
type Multicurryable ::
[Type] ->
((Type -> Type) -> Type) ->
(Type -> Type) ->
Type ->
Type ->
Constraint
class Multicurryable as e_ m r curried | curried -> as e_ m r where
type DownToBaseMonad as e_ m r curried :: Type
multiuncurry :: curried -> NP I as -> DepT e_ m r
multicurry :: (NP I as -> DepT e_ m r) -> curried
_runFromEnv :: m (e_ (DepT e_ m)) -> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
instance Monad m => Multicurryable '[] e_ m r (DepT e_ m r) where
type DownToBaseMonad '[] e_ m r (DepT e_ m r) = m r
multiuncurry :: DepT e_ m r -> NP I '[] -> DepT e_ m r
multiuncurry DepT e_ m r
action NP I '[]
Nil = DepT e_ m r
action
multicurry :: (NP I '[] -> DepT e_ m r) -> DepT e_ m r
multicurry NP I '[] -> DepT e_ m r
f = NP I '[] -> DepT e_ m r
f NP I '[]
forall k (a :: k -> *). NP a '[]
Nil
_runFromEnv :: m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> DepT e_ m r)
-> DownToBaseMonad '[] e_ m r (DepT e_ m r)
_runFromEnv m (e_ (DepT e_ m))
producer e_ (DepT e_ m) -> DepT e_ m r
extractor = do
e_ (DepT e_ m)
e <- m (e_ (DepT e_ m))
producer
DepT e_ m r -> e_ (DepT e_ m) -> m r
forall (e_ :: (* -> *) -> *) (m :: * -> *) r.
DepT e_ m r -> e_ (DepT e_ m) -> m r
runDepT (e_ (DepT e_ m) -> DepT e_ m r
extractor e_ (DepT e_ m)
e) e_ (DepT e_ m)
e
instance Multicurryable as e_ m r curried => Multicurryable (a ': as) e_ m r (a -> curried) where
type DownToBaseMonad (a ': as) e_ m r (a -> curried) = a -> DownToBaseMonad as e_ m r curried
multiuncurry :: (a -> curried) -> NP I (a : as) -> DepT e_ m r
multiuncurry a -> curried
f (I x
a :* NP I xs
as) = curried -> NP I as -> DepT e_ m r
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
curried -> NP I as -> DepT e_ m r
multiuncurry @as @e_ @m @r @curried (a -> curried
f a
x
a) NP I as
NP I xs
as
multicurry :: (NP I (a : as) -> DepT e_ m r) -> a -> curried
multicurry NP I (a : as) -> DepT e_ m r
f a
a = (NP I as -> DepT e_ m r) -> curried
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
(NP I as -> DepT e_ m r) -> curried
multicurry @as @e_ @m @r @curried (NP I (a : as) -> DepT e_ m r
f (NP I (a : as) -> DepT e_ m r)
-> (NP I as -> NP I (a : as)) -> NP I as -> DepT e_ m r
forall b c a. (b -> c) -> (a -> b) -> a -> c
. I a -> NP I as -> NP I (a : as)
forall k (a :: k -> *) (x :: k) (xs :: [k]).
a x -> NP a xs -> NP a (x : xs)
(:*) (a -> I a
forall a. a -> I a
I a
a))
_runFromEnv :: m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> a -> curried)
-> DownToBaseMonad (a : as) e_ m r (a -> curried)
_runFromEnv m (e_ (DepT e_ m))
producer e_ (DepT e_ m) -> a -> curried
extractor a
a = m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
_runFromEnv @as @e_ @m @r @curried m (e_ (DepT e_ m))
producer (\e_ (DepT e_ m)
f -> e_ (DepT e_ m) -> a -> curried
extractor e_ (DepT e_ m)
f a
a)
runFinalDepT ::
forall as e_ m r curried.
Multicurryable as e_ m r curried =>
m (e_ (DepT e_ m)) ->
curried ->
DownToBaseMonad as e_ m r curried
runFinalDepT :: m (e_ (DepT e_ m)) -> curried -> DownToBaseMonad as e_ m r curried
runFinalDepT m (e_ (DepT e_ m))
producer curried
extractor = m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
_runFromEnv m (e_ (DepT e_ m))
producer (curried -> e_ (DepT e_ m) -> curried
forall a b. a -> b -> a
const curried
extractor)
runFromEnv ::
forall as e_ m r curried.
Multicurryable as e_ m r curried =>
m (e_ (DepT e_ m)) ->
(e_ (DepT e_ m) -> curried) ->
DownToBaseMonad as e_ m r curried
runFromEnv :: m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
runFromEnv = m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
forall (as :: [*]) (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Multicurryable as e_ m r curried =>
m (e_ (DepT e_ m))
-> (e_ (DepT e_ m) -> curried) -> DownToBaseMonad as e_ m r curried
_runFromEnv
restrictArgs ::
forall more less e_ m r.
(forall x. Dict more x -> Dict less x) ->
Advice less e_ m r ->
Advice more e_ m r
restrictArgs :: (forall x. Dict more x -> Dict less x)
-> Advice less e_ m r -> Advice more e_ m r
restrictArgs forall x. Dict more x -> Dict less x
evidence (Advice Proxy u
proxy forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as)
tweakArgs u -> DepT e_ m r -> DepT e_ m r
tweakExecution) =
let captureExistential ::
forall more less e_ m r u.
(forall x. Dict more x -> Dict less x) ->
Proxy u ->
( forall as.
All less as =>
NP I as ->
DepT e_ m (u, NP I as)
) ->
( u ->
DepT e_ m r ->
DepT e_ m r
) ->
Advice more e_ m r
captureExistential :: (forall x. Dict more x -> Dict less x)
-> Proxy u
-> (forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice more e_ m r
captureExistential forall x. Dict more x -> Dict less x
evidence' Proxy u
_ forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as)
tweakArgs' u -> DepT e_ m r -> DepT e_ m r
tweakExecution' =
Proxy u
-> (forall (as :: [*]).
All more as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice more e_ m r
forall u (ca :: * -> Constraint) (e_ :: (* -> *) -> *)
(m :: * -> *) r.
Proxy u
-> (forall (as :: [*]).
All ca as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice ca e_ m r
Advice
(Proxy u
forall k (t :: k). Proxy t
Proxy @u)
( let tweakArgs'' :: forall as. All more as => NP I as -> DepT e_ m (u, NP I as)
tweakArgs'' :: NP I as -> DepT e_ m (u, NP I as)
tweakArgs'' = case (forall x. Dict more x -> Dict less x)
-> Dict (All more) as -> Dict (All less) as
forall k (c :: k -> Constraint) (d :: k -> Constraint) (xs :: [k]).
(forall (a :: k). Dict c a -> Dict d a)
-> Dict (All c) xs -> Dict (All d) xs
Data.SOP.Dict.mapAll @more @less forall x. Dict more x -> Dict less x
evidence' of
Dict (All more) as -> Dict (All less) as
f -> case Dict (All more) as -> Dict (All less) as
f (All more as => Dict (All more) as
forall k (c :: k -> Constraint) (a :: k). c a => Dict c a
Dict @(All more) @as) of
Dict (All less) as
Dict -> \NP I as
args -> NP I as -> DepT e_ m (u, NP I as)
forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as)
tweakArgs' @as NP I as
args
in NP I as -> DepT e_ m (u, NP I as)
forall (as :: [*]).
All more as =>
NP I as -> DepT e_ m (u, NP I as)
tweakArgs''
)
u -> DepT e_ m r -> DepT e_ m r
tweakExecution'
in (forall x. Dict more x -> Dict less x)
-> Proxy u
-> (forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice more e_ m r
forall (more :: * -> Constraint) (less :: * -> Constraint)
(e_ :: (* -> *) -> *) (m :: * -> *) r u.
(forall x. Dict more x -> Dict less x)
-> Proxy u
-> (forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as))
-> (u -> DepT e_ m r -> DepT e_ m r)
-> Advice more e_ m r
captureExistential forall x. Dict more x -> Dict less x
evidence Proxy u
proxy forall (as :: [*]).
All less as =>
NP I as -> DepT e_ m (u, NP I as)
tweakArgs u -> DepT e_ m r -> DepT e_ m r
tweakExecution
type Gullible ::
[Type] ->
Type ->
((Type -> Type) -> Type) ->
(Type -> Type) ->
Type ->
Type ->
Constraint
class Multicurryable as e_ m r curried => Gullible as e e_ m r curried where
type NewtypedEnv as e e_ m r curried :: Type
_deceive :: (e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
instance Monad m => Gullible '[] e e_ m r (DepT e_ m r) where
type NewtypedEnv '[] e e_ m r (DepT e_ m r) = ReaderT e m r
_deceive :: (e_ (DepT e_ m) -> e)
-> NewtypedEnv '[] e e_ m r (DepT e_ m r) -> DepT e_ m r
_deceive e_ (DepT e_ m) -> e
f NewtypedEnv '[] e e_ m r (DepT e_ m r)
action = ReaderT (e_ (DepT e_ m)) m r -> DepT e_ m r
forall (e_ :: (* -> *) -> *) (m :: * -> *) r.
ReaderT (e_ (DepT e_ m)) m r -> DepT e_ m r
DepT ((e_ (DepT e_ m) -> e)
-> ReaderT e m r -> ReaderT (e_ (DepT e_ m)) m r
forall r' r (m :: * -> *) a.
(r' -> r) -> ReaderT r m a -> ReaderT r' m a
withReaderT e_ (DepT e_ m) -> e
f ReaderT e m r
NewtypedEnv '[] e e_ m r (DepT e_ m r)
action)
instance Gullible as e e_ m r curried => Gullible (a ': as) e e_ m r (a -> curried) where
type NewtypedEnv (a ': as) e e_ m r (a -> curried) = a -> NewtypedEnv as e e_ m r curried
_deceive :: (e_ (DepT e_ m) -> e)
-> NewtypedEnv (a : as) e e_ m r (a -> curried) -> a -> curried
_deceive e_ (DepT e_ m) -> e
f NewtypedEnv (a : as) e e_ m r (a -> curried)
g a
a = (e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
forall (as :: [*]) e (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Gullible as e e_ m r curried =>
(e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
deceive @as @e @e_ @m @r e_ (DepT e_ m) -> e
f (NewtypedEnv (a : as) e e_ m r (a -> curried)
a -> NewtypedEnv as e e_ m r curried
g a
a)
deceive ::
forall as e e_ m r curried.
Gullible as e e_ m r curried =>
(e_ (DepT e_ m) -> e) ->
NewtypedEnv as e e_ m r curried ->
curried
deceive :: (e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
deceive = (e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
forall (as :: [*]) e (e_ :: (* -> *) -> *) (m :: * -> *) r curried.
Gullible as e e_ m r curried =>
(e_ (DepT e_ m) -> e) -> NewtypedEnv as e e_ m r curried -> curried
_deceive