compdata-0.12.1: Compositional Data Types
Copyright(c) 2011 Patrick Bahr
LicenseBSD3
MaintainerPatrick Bahr <paba@diku.dk>
Stabilityexperimental
Portabilitynon-portable (GHC Extensions)
Safe HaskellNone
LanguageHaskell2010

Data.Comp.Multi.Annotation

Description

This module defines annotations on signatures. All definitions are generalised versions of those in Data.Comp.Annotation.

Synopsis

Documentation

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

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

Instances details
DistAnn f p (f :&: p) Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

injectA :: forall (a :: Type -> Type). p -> f a :-> (f :&: p) a Source #

projectA :: forall (a :: Type -> Type). (f :&: p) a :-> (f a :&: p) Source #

HFunctor f => HFunctor (f :&: a) Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

hfmap :: forall (f0 :: Type -> Type) (g :: Type -> Type). (f0 :-> g) -> (f :&: a) f0 :-> (f :&: a) g Source #

HFoldable f => HFoldable (f :&: a) Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

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

hfoldMap :: forall m (a0 :: Type -> Type). Monoid m => (a0 :=> m) -> (f :&: a) a0 :=> m Source #

hfoldr :: forall (a0 :: Type -> Type) b. (a0 :=> (b -> b)) -> b -> (f :&: a) a0 :=> b Source #

hfoldl :: forall b (a0 :: Type -> Type). (b -> a0 :=> b) -> b -> (f :&: a) a0 :=> b Source #

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

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

HTraversable f => HTraversable (f :&: a) Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

hmapM :: forall (m :: Type -> Type) (a0 :: Type -> Type) (b :: Type -> Type). Monad m => NatM m a0 b -> NatM m ((f :&: a) a0) ((f :&: a) b) Source #

htraverse :: forall (f0 :: Type -> Type) (a0 :: Type -> Type) (b :: Type -> Type). Applicative f0 => NatM f0 a0 b -> NatM f0 ((f :&: a) a0) ((f :&: a) b) Source #

(ShowHF f, Show p) => ShowHF (f :&: p) Source # 
Instance details

Defined in Data.Comp.Multi.Show

Methods

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

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

RemA (f :&: p) f Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

remA :: forall (a :: Type -> Type). (f :&: p) a :-> f a Source #

DistAnn s p s' => DistAnn (f :+: s) p ((f :&: p) :+: s') Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

injectA :: forall (a :: Type -> Type). p -> (f :+: s) a :-> ((f :&: p) :+: s') a Source #

projectA :: forall (a :: Type -> Type). ((f :&: p) :+: s') a :-> ((f :+: s) a :&: p) Source #

RemA s s' => RemA ((f :&: p) :+: s) (f :+: s') Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

remA :: forall (a :: Type -> Type). ((f :&: p) :+: s) a :-> (f :+: s') a Source #

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

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

Methods

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

This function injects an annotation over a signature.

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

Instances

Instances details
DistAnn f p (f :&: p) Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

injectA :: forall (a :: Type -> Type). p -> f a :-> (f :&: p) a Source #

projectA :: forall (a :: Type -> Type). (f :&: p) a :-> (f a :&: p) Source #

DistAnn s p s' => DistAnn (f :+: s) p ((f :&: p) :+: s') Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

injectA :: forall (a :: Type -> Type). p -> (f :+: s) a :-> ((f :&: p) :+: s') a Source #

projectA :: forall (a :: Type -> Type). ((f :&: p) :+: s') a :-> ((f :+: s) a :&: p) Source #

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

Methods

remA :: s a :-> s' a Source #

Instances

Instances details
RemA (f :&: p) f Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

remA :: forall (a :: Type -> Type). (f :&: p) a :-> f a Source #

RemA s s' => RemA ((f :&: p) :+: s) (f :+: s') Source # 
Instance details

Defined in Data.Comp.Multi.Ops

Methods

remA :: forall (a :: Type -> Type). ((f :&: p) :+: s) a :-> (f :+: s') a Source #

liftA :: RemA s s' => (s' a :-> t) -> s a :-> t Source #

This function transforms a function with a domain constructed from a functor to a function with a domain constructed with the same functor but with an additional annotation.

ann :: (DistAnn f p g, HFunctor f) => p -> CxtFun f g Source #

This function annotates each sub term of the given term with the given value (of type a).

liftA' :: (DistAnn s' p s, HFunctor s') => (s' a :-> Cxt h s' a) -> s a :-> Cxt h s a Source #

This function transforms a function with a domain constructed from a functor to a function with a domain constructed with the same functor but with an additional annotation.

stripA :: (RemA g f, HFunctor g) => CxtFun g f Source #

This function strips the annotations from a term over a functor with annotations.

propAnn :: (DistAnn f p f', DistAnn g p g', HFunctor g) => Hom f g -> Hom f' g' Source #

project' :: (RemA f f', s :<: f') => Cxt h f a i -> Maybe (s (Cxt h f a) i) Source #

This function is similar to project but applies to signatures with an annotation which is then ignored.