Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- type family Append l r where ...
- extendMembership :: forall r r' e. ElemOf e r -> ElemOf e (Append r r')
- subsumeMembership :: forall r r' e. Members r r' => ElemOf e r -> ElemOf e r'
- weakenList :: forall r' r m a. KnownList r' => Union r m a -> Union (Append r' r) m a
- class KnownList (l :: [k]) where
- unconsKnownList :: (l ~ '[] => a) -> (forall x r. (l ~ (x ': r), KnownList r) => Proxy x -> Proxy r -> a) -> a
Documentation
class KnownList (l :: [k]) where Source #
A class for type-level lists with a known spine.
This constraint is eventually satisfied as r
is instantied to a
concrete list.
unconsKnownList :: (l ~ '[] => a) -> (forall x r. (l ~ (x ': r), KnownList r) => Proxy x -> Proxy r -> a) -> a Source #
Instances
KnownList ('[] :: [k]) Source # | |
Defined in Polysemy.Internal.Bundle | |
KnownList r => KnownList (x ': r :: [k]) Source # | |
Defined in Polysemy.Internal.Bundle |