{-# 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 #-}
{-# LANGUAGE BlockArguments #-}
module Dep.ReaderAdvice
(
Advice,
makeAdvice,
makeArgsAdvice,
makeExecutionAdvice,
advise,
restrictArgs,
adviseRecord,
Top,
And,
All,
NP (..),
I (..),
cfoldMap_NP,
Dict (..)
)
where
import Dep.Has
import Dep.Env
import Control.Monad.Trans.Reader (ReaderT (..), withReaderT)
import Data.Functor.Identity
import Data.Kind
import Data.List.NonEmpty qualified as N
import Data.List.NonEmpty (NonEmpty)
import Data.SOP
import Data.SOP.Dict
import Data.SOP.NP
import Data.Typeable
import GHC.Generics qualified as G
import GHC.TypeLits
import Data.Coerce
import Data.Bifunctor (first)
type Advice ::
(Type -> Constraint) ->
Type ->
(Type -> Type) ->
Type ->
Type
data Advice (ca :: Type -> Constraint) e m r where
Advice ::
forall ca e m r.
( forall as.
All ca as =>
NP I as ->
ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
) ->
Advice ca e m r
instance Monad m => Semigroup (Advice ca e m r) where
Advice forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
outer <> :: Advice ca e m r -> Advice ca e m r -> Advice ca e m r
<> Advice forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
inner = forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
Advice \NP I as
args -> do
(ReaderT e m r -> ReaderT e m r
tweakOuter, NP I as
argsOuter) <- forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
outer NP I as
args
(ReaderT e m r -> ReaderT e m r
tweakInner, NP I as
argsInner) <- forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
inner NP I as
argsOuter
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ReaderT e m r -> ReaderT e m r
tweakOuter forall b c a. (b -> c) -> (a -> b) -> a -> c
. ReaderT e m r -> ReaderT e m r
tweakInner, NP I as
argsInner)
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 = forall a. Semigroup a => a -> a -> a
(<>)
mempty :: Advice ca e m r
mempty = forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
Advice \NP I as
args -> forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall a. a -> a
id, NP I as
args)
makeAdvice ::
forall ca e m r.
( forall as.
All ca as =>
NP I as ->
ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
) ->
Advice ca e m r
makeAdvice :: forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
makeAdvice = forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
Advice
makeArgsAdvice ::
forall ca e m r.
Monad m =>
( forall as.
All ca as =>
NP I as ->
ReaderT e m (NP I as)
) ->
Advice ca e m r
makeArgsAdvice :: forall (ca :: * -> Constraint) e (m :: * -> *) r.
Monad m =>
(forall (as :: [*]). All ca as => NP I as -> ReaderT e m (NP I as))
-> Advice ca e m r
makeArgsAdvice forall (as :: [*]). All ca as => NP I as -> ReaderT e m (NP I as)
tweakArgs =
forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
makeAdvice forall a b. (a -> b) -> a -> b
$ \NP I as
args -> do
NP I as
args' <- forall (as :: [*]). All ca as => NP I as -> ReaderT e m (NP I as)
tweakArgs NP I as
args
forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall a. a -> a
id, NP I as
args')
makeExecutionAdvice ::
forall ca e m r.
Applicative m =>
( ReaderT e m r ->
ReaderT e m r
) ->
Advice ca e m r
makeExecutionAdvice :: forall (ca :: * -> Constraint) e (m :: * -> *) r.
Applicative m =>
(ReaderT e m r -> ReaderT e m r) -> Advice ca e m r
makeExecutionAdvice ReaderT e m r -> ReaderT e m r
tweakExecution = forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
makeAdvice \NP I as
args -> forall (f :: * -> *) a. Applicative f => a -> f a
pure (ReaderT e m r -> ReaderT e m r
tweakExecution, NP I as
args)
data Pair a b = Pair !a !b
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 :: forall (ca :: * -> Constraint) 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 forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
f) advisee
advisee = do
let uncurried :: NP I as -> ReaderT e m r
uncurried = forall (as :: [*]) e (m :: * -> *) r curried.
Multicurryable as e m r curried =>
curried -> NP I as -> ReaderT e m r
multiuncurry @as @e @m @r advisee
advisee
uncurried' :: NP I as -> ReaderT e m r
uncurried' NP I as
args = do
(ReaderT e m r -> ReaderT e m r
tweakExecution, NP I as
args') <- forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
f NP I as
args
ReaderT e m r -> ReaderT e m r
tweakExecution (NP I as -> ReaderT e m r
uncurried NP I as
args')
in forall (as :: [*]) e (m :: * -> *) r curried.
Multicurryable as e m r curried =>
(NP I as -> ReaderT e m r) -> curried
multicurry @as @e @m @r NP I as -> ReaderT e m r
uncurried'
type Multicurryable ::
[Type] ->
Type ->
(Type -> Type) ->
Type ->
Type ->
Constraint
class Multicurryable as e m r curried | curried -> as e m r where
multiuncurry :: curried -> NP I as -> ReaderT e m r
multicurry :: (NP I as -> ReaderT e m r) -> curried
instance Monad m => Multicurryable '[] e m r (ReaderT e m r) where
multiuncurry :: ReaderT e m r -> NP I '[] -> ReaderT e m r
multiuncurry ReaderT e m r
action NP I '[]
Nil = ReaderT e m r
action
multicurry :: (NP I '[] -> ReaderT e m r) -> ReaderT e m r
multicurry NP I '[] -> ReaderT e m r
f = NP I '[] -> ReaderT e m r
f forall {k} (a :: k -> *). NP a '[]
Nil
instance (Functor m, Multicurryable as e m r curried) => Multicurryable (a ': as) e m r (a -> curried) where
multiuncurry :: (a -> curried) -> NP I (a : as) -> ReaderT e m r
multiuncurry a -> curried
f (I x
a :* NP I xs
as) = forall (as :: [*]) e (m :: * -> *) r curried.
Multicurryable as e m r curried =>
curried -> NP I as -> ReaderT e m r
multiuncurry @as @e @m @r @curried (a -> curried
f x
a) NP I xs
as
multicurry :: (NP I (a : as) -> ReaderT e m r) -> a -> curried
multicurry NP I (a : as) -> ReaderT e m r
f a
a = forall (as :: [*]) e (m :: * -> *) r curried.
Multicurryable as e m r curried =>
(NP I as -> ReaderT e m r) -> curried
multicurry @as @e @m @r @curried (NP I (a : as) -> ReaderT e m r
f forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (a :: k -> *) (x :: k) (xs :: [k]).
a x -> NP a xs -> NP a (x : xs)
(:*) (forall a. a -> I a
I a
a))
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 (more :: * -> Constraint) (less :: * -> Constraint) 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
evidence (Advice forall (as :: [*]).
All less as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
advice) = forall (ca :: * -> Constraint) e (m :: * -> *) r.
(forall (as :: [*]).
All ca as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as))
-> Advice ca e m r
Advice \NP I as
args ->
let advice' :: forall as. All more as => NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
advice' :: forall (as :: [*]).
All more as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
advice' NP I as
args' =
case 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 (forall {k} (c :: k -> Constraint) (a :: k). c a => Dict c a
Dict @(All more) @as) of
Dict (All less) as
Dict -> forall (as :: [*]).
All less as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
advice NP I as
args'
in forall (as :: [*]).
All more as =>
NP I as -> ReaderT e m (ReaderT e m r -> ReaderT e m r, NP I as)
advice' NP I as
args
data RecordComponent
= Terminal
| IWrapped
| Recurse
type AdvisedRecord :: (Type -> Constraint) -> Type -> (Type -> Type) -> (Type -> Constraint) -> ((Type -> Type) -> Type) -> Constraint
class AdvisedRecord ca e m cr advised where
_adviseRecord :: [(TypeRep, String)] -> (forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r) -> advised (ReaderT e m) -> advised (ReaderT e m)
type AdvisedProduct :: (Type -> Constraint) -> Type -> (Type -> Type) -> (Type -> Constraint) -> (k -> Type) -> Constraint
class AdvisedProduct ca e m cr advised_ where
_adviseProduct :: TypeRep -> [(TypeRep, String)] -> (forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r) -> advised_ k -> advised_ k
instance
( G.Generic (advised (ReaderT e m)),
G.Rep (advised (ReaderT e m)) ~ G.D1 x (G.C1 y advised_),
Typeable advised,
AdvisedProduct ca e m cr advised_
) =>
AdvisedRecord ca e m cr advised
where
_adviseRecord :: [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised (ReaderT e m)
-> advised (ReaderT e m)
_adviseRecord [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised (ReaderT e m)
unadvised =
let G.M1 (G.M1 advised_ Any
unadvised_) = forall a x. Generic a => a -> Rep a x
G.from advised (ReaderT e m)
unadvised
advised_ :: advised_ Any
advised_ = forall k (ca :: * -> Constraint) e (m :: * -> *)
(cr :: * -> Constraint) (advised_ :: k -> *) (k :: k).
AdvisedProduct ca e m cr advised_ =>
TypeRep
-> [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised_ k
-> advised_ k
_adviseProduct @_ @ca @e @m @cr (forall {k} (proxy :: k -> *) (a :: k).
Typeable a =>
proxy a -> TypeRep
typeRep (forall {k} (t :: k). Proxy t
Proxy @advised)) [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised_ Any
unadvised_
in forall a x. Generic a => Rep a x -> a
G.to (forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 (forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 advised_ Any
advised_))
instance
( AdvisedProduct ca e m cr advised_left,
AdvisedProduct ca e m cr advised_right
) =>
AdvisedProduct ca e m cr (advised_left G.:*: advised_right)
where
_adviseProduct :: forall (k :: k).
TypeRep
-> [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> (:*:) advised_left advised_right k
-> (:*:) advised_left advised_right k
_adviseProduct TypeRep
tr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f (advised_left k
unadvised_left G.:*: advised_right k
unadvised_right) = forall k (ca :: * -> Constraint) e (m :: * -> *)
(cr :: * -> Constraint) (advised_ :: k -> *) (k :: k).
AdvisedProduct ca e m cr advised_ =>
TypeRep
-> [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised_ k
-> advised_ k
_adviseProduct @_ @ca @e @m @cr TypeRep
tr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised_left k
unadvised_left forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
G.:*: forall k (ca :: * -> Constraint) e (m :: * -> *)
(cr :: * -> Constraint) (advised_ :: k -> *) (k :: k).
AdvisedProduct ca e m cr advised_ =>
TypeRep
-> [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised_ k
-> advised_ k
_adviseProduct @_ @ca @e @m @cr TypeRep
tr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised_right k
unadvised_right
type DiscriminateAdvisedComponent :: Type -> RecordComponent
type family DiscriminateAdvisedComponent c where
DiscriminateAdvisedComponent (_ -> _) = 'Terminal
DiscriminateAdvisedComponent (ReaderT _ _ _) = 'Terminal
DiscriminateAdvisedComponent (Identity _) = 'IWrapped
DiscriminateAdvisedComponent (I _) = 'IWrapped
DiscriminateAdvisedComponent _ = 'Recurse
type AdvisedComponent :: RecordComponent -> (Type -> Constraint) -> Type -> (Type -> Type) -> (Type -> Constraint) -> Type -> Constraint
class AdvisedComponent component_type ca e m cr advised where
_adviseComponent :: [(TypeRep, String)] -> (forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r) -> advised -> advised
instance
( AdvisedComponent (DiscriminateAdvisedComponent advised) ca e m cr advised,
KnownSymbol fieldName
) =>
AdvisedProduct ca e m cr (G.S1 ( 'G.MetaSel ( 'Just fieldName) su ss ds) (G.Rec0 advised))
where
_adviseProduct :: forall (k :: k).
TypeRep
-> [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> S1 ('MetaSel ('Just fieldName) su ss ds) (Rec0 advised) k
-> S1 ('MetaSel ('Just fieldName) su ss ds) (Rec0 advised) k
_adviseProduct TypeRep
tr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f (G.M1 (G.K1 advised
advised)) =
let acc' :: [(TypeRep, String)]
acc' = (TypeRep
tr, forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal (forall {k} (t :: k). Proxy t
Proxy @fieldName)) forall a. a -> [a] -> [a]
: [(TypeRep, String)]
acc
in forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 (forall k i c (p :: k). c -> K1 i c p
G.K1 (forall (component_type :: RecordComponent) (ca :: * -> Constraint)
e (m :: * -> *) (cr :: * -> Constraint) advised.
AdvisedComponent component_type ca e m cr advised =>
[(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised
-> advised
_adviseComponent @(DiscriminateAdvisedComponent advised) @ca @e @m @cr [(TypeRep, String)]
acc' forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised
advised))
instance
(Multicurryable as e m r advised, All ca as, cr r, Monad m) =>
AdvisedComponent 'Terminal ca e m cr advised
where
_adviseComponent :: [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised
-> advised
_adviseComponent [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised
advised = forall (ca :: * -> Constraint) e (m :: * -> *) r (as :: [*])
advisee.
(Multicurryable as e m r advisee, All ca as, Monad m) =>
Advice ca e m r -> advisee -> advisee
advise @ca @e @m (forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f (forall a. [a] -> NonEmpty a
N.fromList [(TypeRep, String)]
acc)) advised
advised
instance
AdvisedComponent (DiscriminateAdvisedComponent advised) ca e m cr advised =>
AdvisedComponent 'IWrapped ca e m cr (Identity advised)
where
_adviseComponent :: [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> Identity advised
-> Identity advised
_adviseComponent [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f (Identity advised
advised) = forall a. a -> Identity a
Identity (forall (component_type :: RecordComponent) (ca :: * -> Constraint)
e (m :: * -> *) (cr :: * -> Constraint) advised.
AdvisedComponent component_type ca e m cr advised =>
[(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised
-> advised
_adviseComponent @(DiscriminateAdvisedComponent advised) @ca @e @m @cr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised
advised)
instance
AdvisedComponent (DiscriminateAdvisedComponent advised) ca e m cr advised =>
AdvisedComponent 'IWrapped ca e m cr (I advised)
where
_adviseComponent :: [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> I advised
-> I advised
_adviseComponent [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f (I advised
advised) = forall a. a -> I a
I (forall (component_type :: RecordComponent) (ca :: * -> Constraint)
e (m :: * -> *) (cr :: * -> Constraint) advised.
AdvisedComponent component_type ca e m cr advised =>
[(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised
-> advised
_adviseComponent @(DiscriminateAdvisedComponent advised) @ca @e @m @cr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advised
advised)
instance
AdvisedRecord ca e m cr advisable =>
AdvisedComponent 'Recurse ca e m cr (advisable (ReaderT e m))
where
_adviseComponent :: [(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advisable (ReaderT e m)
-> advisable (ReaderT e m)
_adviseComponent [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advisable (ReaderT e m)
advised = forall (ca :: * -> Constraint) e (m :: * -> *)
(cr :: * -> Constraint) (advisable :: (* -> *) -> *).
AdvisedRecord ca e m cr advisable =>
[(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advisable (ReaderT e m)
-> advisable (ReaderT e m)
_adviseRecord @ca @e @m @cr [(TypeRep, String)]
acc forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r
f advisable (ReaderT e m)
advised
adviseRecord ::
forall ca cr e m advised.
AdvisedRecord ca e m cr advised =>
(forall r . cr r => NonEmpty (TypeRep, String) -> Advice ca e m r) ->
advised (ReaderT e m) ->
advised (ReaderT e m)
adviseRecord :: forall (ca :: * -> Constraint) (cr :: * -> Constraint) e
(m :: * -> *) (advised :: (* -> *) -> *).
AdvisedRecord ca e m cr advised =>
(forall r. cr r => NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advised (ReaderT e m) -> advised (ReaderT e m)
adviseRecord = forall (ca :: * -> Constraint) e (m :: * -> *)
(cr :: * -> Constraint) (advisable :: (* -> *) -> *).
AdvisedRecord ca e m cr advisable =>
[(TypeRep, String)]
-> (forall r.
cr r =>
NonEmpty (TypeRep, String) -> Advice ca e m r)
-> advisable (ReaderT e m)
-> advisable (ReaderT e m)
_adviseRecord @ca @e @m @cr []