Data.Comp.Multi.Ops

This module provides operators on higher-order functors. All definitions are generalised versions of those in Data.Comp.Ops.

Documentation

class RemA (s :: (* -> *) -> * -> *) s' | s -> s' where

Minimal complete definition

remA

Methods

remA :: s a :-> s' a

Instances

RemA (f :&: p) f

Defined in Data.Comp.Multi.Ops

Methods

remA :: (f :&: p) a i -> f a i

RemA s s' => RemA ((f :&: p) :+: s) (f :+: s')

Defined in Data.Comp.Multi.Ops

Methods

remA :: ((f :&: p) :+: s) a i -> (f :+: s') a i

class DistAnn (s :: (* -> *) -> * -> *) p s' | s' -> s, s' -> p where

This class defines how to distribute an annotation over a sum of signatures.

Minimal complete definition

injectA, projectA

Methods

injectA :: p -> s a :-> s' a

This function injects an annotation over a signature.

projectA :: s' a :-> (s a :&: p)

Instances

DistAnn f p (f :&: p)

Defined in Data.Comp.Multi.Ops

Methods

injectA :: p -> f a :-> (f :&: p) a

projectA :: (f :&: p) a i -> (f a :&: p) i

DistAnn s p s' => DistAnn (f :+: s) p ((f :&: p) :+: s')

Defined in Data.Comp.Multi.Ops

Methods

injectA :: p -> (f :+: s) a :-> ((f :&: p) :+: s') a

projectA :: ((f :&: p) :+: s') a i -> ((f :+: s) a :&: p) i

data (f :&: a) (g :: * -> *) e infixr 7

This data type adds a constant product to a signature. Alternatively, this could have also been defined as

data (f :&: a) (g ::  * -> *) e = f g e :&: a e

This is too general, however, for example for productHHom.

Constructors

(f g e) :&: a infixr 7

Instances

DistAnn f p (f :&: p)

Defined in Data.Comp.Multi.Ops

Methods

injectA :: p -> f a :-> (f :&: p) a

projectA :: (f :&: p) a i -> (f a :&: p) i

HFunctor f => HFunctor (f :&: a)

Defined in Data.Comp.Multi.Ops

Methods

hfmap :: (f0 :-> g) -> (f :&: a) f0 :-> (f :&: a) g

HFoldable f => HFoldable (f :&: a)

Defined in Data.Comp.Multi.Ops

Methods

hfold :: Monoid m => (f :&: a) (K m) :=> m

hfoldMap :: Monoid m => (a0 :=> m) -> (f :&: a) a0 :=> m

hfoldr :: (a0 :=> (b -> b)) -> b -> (f :&: a) a0 :=> b

hfoldl :: (b -> a0 :=> b) -> b -> (f :&: a) a0 :=> b

hfoldr1 :: (a0 -> a0 -> a0) -> (f :&: a) (K a0) :=> a0

hfoldl1 :: (a0 -> a0 -> a0) -> (f :&: a) (K a0) :=> a0

HTraversable f => HTraversable (f :&: a)

Defined in Data.Comp.Multi.Ops

Methods

hmapM :: Monad m => NatM m a0 b -> NatM m ((f :&: a) a0) ((f :&: a) b)

htraverse :: Applicative f0 => NatM f0 a0 b -> NatM f0 ((f :&: a) a0) ((f :&: a) b)

(ShowHF f, Show p) => ShowHF (f :&: p)

Defined in Data.Comp.Multi.Show

Methods

showHF :: Alg (f :&: p) (K String)

showHF' :: (f :&: p) (K String) :=> String

RemA (f :&: p) f

Defined in Data.Comp.Multi.Ops

Methods

remA :: (f :&: p) a i -> f a i

DistAnn s p s' => DistAnn (f :+: s) p ((f :&: p) :+: s')

Defined in Data.Comp.Multi.Ops

Methods

injectA :: p -> (f :+: s) a :-> ((f :&: p) :+: s') a

projectA :: ((f :&: p) :+: s') a i -> ((f :+: s) a :&: p) i

RemA s s' => RemA ((f :&: p) :+: s) (f :+: s')

Defined in Data.Comp.Multi.Ops

Methods

remA :: ((f :&: p) :+: s) a i -> (f :+: s') a i

type (:=:) f g = (f :<: g, g :<: f) infixl 5

type (:<:) f g = Subsume (ComprEmb (Elem f g)) f g infixl 5

A constraint f :<: g expresses that the signature f is subsumed by g, i.e. f can be used to construct elements in g.

class Subsume (e :: Emb) (f :: (* -> *) -> * -> *) (g :: (* -> *) -> * -> *) where

Minimal complete definition

inj', prj'

Methods

inj' :: Proxy e -> f a :-> g a

prj' :: Proxy e -> NatM Maybe (g a) (f a)

type family Elem (f :: (* -> *) -> * -> *) (g :: (* -> *) -> * -> *) :: Emb where ...

Equations

Elem f f = Found Here

Elem (f1 :+: f2) g = Sum' (Elem f1 g) (Elem f2 g)

Elem f (g1 :+: g2) = Choose (Elem f g1) (Elem f g2)

Elem f g = NotFound

data (f :+: g) (h :: * -> *) e infixr 6

Data type defining coproducts.

Constructors

Inl (f h e)

Inr (g h e)

Instances

(HFunctor f, HFunctor g) => HFunctor (f :+: g)

Defined in Data.Comp.Multi.Ops

Methods

hfmap :: (f0 :-> g0) -> (f :+: g) f0 :-> (f :+: g) g0

(HFoldable f, HFoldable g) => HFoldable (f :+: g)

Defined in Data.Comp.Multi.Ops

Methods

hfold :: Monoid m => (f :+: g) (K m) :=> m

hfoldMap :: Monoid m => (a :=> m) -> (f :+: g) a :=> m

hfoldr :: (a :=> (b -> b)) -> b -> (f :+: g) a :=> b

hfoldl :: (b -> a :=> b) -> b -> (f :+: g) a :=> b

hfoldr1 :: (a -> a -> a) -> (f :+: g) (K a) :=> a

hfoldl1 :: (a -> a -> a) -> (f :+: g) (K a) :=> a

(HTraversable f, HTraversable g) => HTraversable (f :+: g)

Defined in Data.Comp.Multi.Ops

Methods

hmapM :: Monad m => NatM m a b -> NatM m ((f :+: g) a) ((f :+: g) b)

htraverse :: Applicative f0 => NatM f0 a b -> NatM f0 ((f :+: g) a) ((f :+: g) b)

(ShowHF f, ShowHF g) => ShowHF (f :+: g)

Defined in Data.Comp.Multi.Show

Methods

showHF :: Alg (f :+: g) (K String)

showHF' :: (f :+: g) (K String) :=> String

(EqHF f, EqHF g) => EqHF (f :+: g)

EqF is propagated through sums.

Defined in Data.Comp.Multi.Equality

Methods

eqHF :: KEq g0 => (f :+: g) g0 i -> (f :+: g) g0 j -> Bool

(OrdHF f, OrdHF g) => OrdHF (f :+: g)

OrdHF is propagated through sums.

Defined in Data.Comp.Multi.Ordering

Methods

compareHF :: KOrd a => (f :+: g) a i -> (f :+: g) a j -> Ordering

(HasVars f v, HasVars g v) => HasVars (f :+: g) v

Defined in Data.Comp.Multi.Variables

Methods

isVar :: (f :+: g) a i -> Maybe v

bindsVars :: Mapping m a => (f :+: g) a :=> m (Set v)

(Desugar f h, Desugar g h) => Desugar (f :+: g) h

Defined in Data.Comp.Multi.Desugar

Methods

desugHom :: Hom (f :+: g) h

desugHom' :: (f :+: g) (Context h a) i -> Context h a i

DistAnn s p s' => DistAnn (f :+: s) p ((f :&: p) :+: s')

Defined in Data.Comp.Multi.Ops

Methods

injectA :: p -> (f :+: s) a :-> ((f :&: p) :+: s') a

projectA :: ((f :&: p) :+: s') a i -> ((f :+: s) a :&: p) i

RemA s s' => RemA ((f :&: p) :+: s) (f :+: s')

Defined in Data.Comp.Multi.Ops

Methods

remA :: ((f :&: p) :+: s) a i -> (f :+: s') a i

caseH :: (f a b -> c) -> (g a b -> c) -> (f :+: g) a b -> c

Utility function to case on a higher-order functor sum, without exposing the internal representation of sums.

inj :: forall f g a. f :<: g => f a :-> g a

proj :: forall f g a. f :<: g => NatM Maybe (g a) (f a)

spl :: f :=: (f1 :+: f2) => (f1 a :-> b) -> (f2 a :-> b) -> f a :-> b

data (f :*: g) a infixr 8

Formal product of signatures (functors).

Constructors

(f a) :*: (g a) infixr 8

Instances

(Functor f, Functor g) => Functor (f :*: g)

Defined in Data.Comp.Ops

Methods

fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b

(<$) :: a -> (f :*: g) b -> (f :*: g) a

(Foldable f, Foldable g) => Foldable (f :*: g)

Defined in Data.Comp.Ops

Methods

fold :: Monoid m => (f :*: g) m -> m

foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m

foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b

foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b

foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b

foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b

foldr1 :: (a -> a -> a) -> (f :*: g) a -> a

foldl1 :: (a -> a -> a) -> (f :*: g) a -> a

toList :: (f :*: g) a -> [a]

null :: (f :*: g) a -> Bool

length :: (f :*: g) a -> Int

elem :: Eq a => a -> (f :*: g) a -> Bool

maximum :: Ord a => (f :*: g) a -> a

minimum :: Ord a => (f :*: g) a -> a

sum :: Num a => (f :*: g) a -> a

product :: Num a => (f :*: g) a -> a

(Traversable f, Traversable g) => Traversable (f :*: g)

Defined in Data.Comp.Ops

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b)

sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a)

mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b)

sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a)

ffst :: (f :*: g) a -> f a

fsnd :: (f :*: g) a -> g a