Safe Haskell | None |
---|---|
Language | Haskell2010 |
Internals. You will probably never need these.
Documentation
data BinderScope n e Source #
BinderScope | |
|
Instances
newtype BoundScope Source #
Instances
Eq BoundScope Source # | |
Defined in Blanks.UnderScope (==) :: BoundScope -> BoundScope -> Bool # (/=) :: BoundScope -> BoundScope -> Bool # | |
Show BoundScope Source # | |
Defined in Blanks.UnderScope showsPrec :: Int -> BoundScope -> ShowS # show :: BoundScope -> String # showList :: [BoundScope] -> ShowS # |
newtype EmbedScope f e Source #
EmbedScope | |
|
Instances
Functor f => Functor (EmbedScope f) Source # | |
Defined in Blanks.UnderScope fmap :: (a -> b) -> EmbedScope f a -> EmbedScope f b # (<$) :: a -> EmbedScope f b -> EmbedScope f a # | |
Eq (f e) => Eq (EmbedScope f e) Source # | |
Defined in Blanks.UnderScope (==) :: EmbedScope f e -> EmbedScope f e -> Bool # (/=) :: EmbedScope f e -> EmbedScope f e -> Bool # | |
Show (f e) => Show (EmbedScope f e) Source # | |
Defined in Blanks.UnderScope showsPrec :: Int -> EmbedScope f e -> ShowS # show :: EmbedScope f e -> String # showList :: [EmbedScope f e] -> ShowS # |
FreeScope | |
|
Instances
Functor FreeScope Source # | |
Foldable FreeScope Source # | |
Defined in Blanks.UnderScope fold :: Monoid m => FreeScope m -> m # foldMap :: Monoid m => (a -> m) -> FreeScope a -> m # foldr :: (a -> b -> b) -> b -> FreeScope a -> b # foldr' :: (a -> b -> b) -> b -> FreeScope a -> b # foldl :: (b -> a -> b) -> b -> FreeScope a -> b # foldl' :: (b -> a -> b) -> b -> FreeScope a -> b # foldr1 :: (a -> a -> a) -> FreeScope a -> a # foldl1 :: (a -> a -> a) -> FreeScope a -> a # toList :: FreeScope a -> [a] # length :: FreeScope a -> Int # elem :: Eq a => a -> FreeScope a -> Bool # maximum :: Ord a => FreeScope a -> a # minimum :: Ord a => FreeScope a -> a # | |
Traversable FreeScope Source # | |
Eq a => Eq (FreeScope a) Source # | |
Show a => Show (FreeScope a) Source # | |
data UnderScope n f e a Source #
UnderBoundScope !BoundScope | |
UnderFreeScope !(FreeScope a) | |
UnderBinderScope !(BinderScope n e) | |
UnderEmbedScope !(EmbedScope f e) |
Instances
Traversable f => Bitraversable (UnderScope n f) Source # | |
Defined in Blanks.UnderScope bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> UnderScope n f a b -> f0 (UnderScope n f c d) # | |
Foldable f => Bifoldable (UnderScope n f) Source # | |
Defined in Blanks.UnderScope bifold :: Monoid m => UnderScope n f m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> UnderScope n f a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> UnderScope n f a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> UnderScope n f a b -> c # | |
Functor f => Bifunctor (UnderScope n f) Source # | |
Defined in Blanks.UnderScope bimap :: (a -> b) -> (c -> d) -> UnderScope n f a c -> UnderScope n f b d # first :: (a -> b) -> UnderScope n f a c -> UnderScope n f b c # second :: (b -> c) -> UnderScope n f a b -> UnderScope n f a c # | |
Functor (UnderScope n f e) Source # | |
Defined in Blanks.UnderScope fmap :: (a -> b) -> UnderScope n f e a -> UnderScope n f e b # (<$) :: a -> UnderScope n f e b -> UnderScope n f e a # | |
(Eq a, Eq n, Eq e, Eq (f e)) => Eq (UnderScope n f e a) Source # | |
Defined in Blanks.UnderScope (==) :: UnderScope n f e a -> UnderScope n f e a -> Bool # (/=) :: UnderScope n f e a -> UnderScope n f e a -> Bool # | |
(Show a, Show n, Show e, Show (f e)) => Show (UnderScope n f e a) Source # | |
Defined in Blanks.UnderScope showsPrec :: Int -> UnderScope n f e a -> ShowS # show :: UnderScope n f e a -> String # showList :: [UnderScope n f e a] -> ShowS # |
data UnderScopeFold n f e a r Source #
UnderScopeFold | |
|
Instances
Functor (UnderScopeFold n f e a) Source # | |
Defined in Blanks.UnderScope fmap :: (a0 -> b) -> UnderScopeFold n f e a a0 -> UnderScopeFold n f e a b # (<$) :: a0 -> UnderScopeFold n f e a b -> UnderScopeFold n f e a a0 # |
pattern UnderScopeBound :: Int -> UnderScope n f e a Source #
pattern UnderScopeFree :: a -> UnderScope n f e a Source #
pattern UnderScopeBinder :: Int -> n -> e -> UnderScope n f e a Source #
pattern UnderScopeEmbed :: f e -> UnderScope n f e a Source #
underScopeFold :: UnderScopeFold n f e a r -> UnderScope n f e a -> r Source #
underScopeShift :: Functor f => (Int -> Int -> e -> e) -> Int -> Int -> UnderScope n f e a -> UnderScope n f e a Source #