{-# 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,
Top,
And,
All,
NP (..),
I (..),
cfoldMap_NP,
type (:-) (..),
Dict (..),
)
where
import Control.Monad.Dep
import Data.Constraint
import Data.Kind
import Data.SOP
import Data.SOP.Dict qualified as SOP
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 (e (DepT e m)) (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 (env :: (* -> *) -> *) (m :: * -> *) r.
DepT env m r -> env (DepT env 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. more x :- less x) ->
Advice less e m r ->
Advice more e m r
restrictArgs :: (forall x. more x :- less x)
-> Advice less e m r -> Advice more e m r
restrictArgs forall x. more x :- 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. more x :- 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. more x :- 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. more x :- 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 a. Dict more a -> Dict less a)
-> 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
SOP.mapAll @more @less ((forall x. more x :- less x) -> Dict more a -> Dict less a
forall k (more :: k -> Constraint) (less :: k -> Constraint)
(a :: k).
(forall (x :: k). more x :- less x) -> Dict more a -> Dict less a
translateEvidence @more @less forall x. more x :- 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
SOP.Dict @(All more) @as) of
Dict (All less) as
SOP.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. more x :- 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. more x :- 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. more x :- 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
translateEvidence :: forall more less a. (forall x. more x :- less x) -> SOP.Dict more a -> SOP.Dict less a
translateEvidence :: (forall (x :: k). more x :- less x) -> Dict more a -> Dict less a
translateEvidence forall (x :: k). more x :- less x
evidence Dict more a
SOP.Dict =
case more a :- less a
forall (x :: k). more x :- less x
evidence @a of
Sub more a => Dict (less a)
Dict -> less a => Dict less a
forall k (c :: k -> Constraint) (a :: k). c a => Dict c a
SOP.Dict @less @a