Copyright	(C) 2017-18 Jakub Daniel
License	BSD-style (see the file LICENSE)
Maintainer	Jakub Daniel <jakub.daniel@protonmail.com>
Stability	experimental
Safe Haskell	None
Language	Haskell2010

Data.Expression.Utils.Indexed.Sum

Description

Synopsis

data (f :+: g) a i
- = InL (f a i)
- | InR (g a i)
class (IFunctor f, IFunctor g) => f :<: g where
inject :: g :<: f => forall i. g (IFix f) i -> IFix f i
match :: g :<: f => forall i. IFix f i -> Maybe (g (IFix f) i)

Documentation

data (f :+: g) a i infixr 8 Source #

Sum of two indexed functors

Constructors

InL (f a i)
InR (g a i)

Instances

(IShow f, IShow g) => IShow (f :+: g :: (k1 -> ) -> k2 -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods ishow :: (f :+: g) (Const String) i -> Const String i Source #
(IFunctor f, IFunctor g, IFunctor h, f :<: g) => (f :: (k -> ) -> k -> ) :<: (h :+: g :: (k -> ) -> k -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods inj :: f a i -> (h :+: g) a i Source # prj :: (h :+: g) a i -> Maybe (f a i) Source #
(IFunctor f, IFunctor g) => (f :: (k -> ) -> k -> ) :<: (f :+: g :: (k -> ) -> k -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods inj :: f a i -> (f :+: g) a i Source # prj :: (f :+: g) a i -> Maybe (f a i) Source #
(IEq1 f, IEq1 g) => IEq1 (f :+: g :: (i -> ) -> i -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods ieq1 :: IEq a => (f :+: g) a j -> (f :+: g) a j -> Bool Source #
(IFoldable f, IFoldable g) => IFoldable (f :+: g :: (i -> ) -> i -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods ifold :: Monoid m => (f :+: g) (Const m) i' -> Const m i' Source #
(IFunctor f, IFunctor g) => IFunctor (f :+: g :: (i -> ) -> i -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods imap :: (forall (i' :: i0). a i' -> b i') -> forall (i' :: i0). (f :+: g) a i' -> (f :+: g) b i' Source # index :: (f :+: g) a i' -> Sing i' Source #
(ITraversable f, ITraversable g) => ITraversable (f :+: g :: (i -> ) -> i -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods itraverse :: Applicative f0 => (forall (i' :: i0). a i' -> f0 (b i')) -> forall (i' :: i0). (f :+: g) a i' -> f0 ((f :+: g) b i') Source #
(MaybeQuantified f, MaybeQuantified g) => MaybeQuantified (f :+: g :: (k -> ) -> k -> ) Source #
Instance details Defined in Data.Expression Methods isQuantified' :: MaybeQuantified g0 => (f :+: g) (IFix g0) s -> Const Any s freevars' :: (f :+: g) (Const [DynamicallySorted VarF]) s -> Const [DynamicallySorted VarF] s
JoinSemiLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression Methods (\/) :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort # join :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort #
JoinSemiLattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression Methods (\/) :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort # join :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort #
JoinSemiLattice (Lia BooleanSort) #
Instance details Defined in Data.Expression Methods (\/) :: Lia BooleanSort -> Lia BooleanSort -> Lia BooleanSort # join :: Lia BooleanSort -> Lia BooleanSort -> Lia BooleanSort #
JoinSemiLattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression Methods (\/) :: QFLia BooleanSort -> QFLia BooleanSort -> QFLia BooleanSort # join :: QFLia BooleanSort -> QFLia BooleanSort -> QFLia BooleanSort #
JoinSemiLattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression Methods (\/) :: QFLogic BooleanSort -> QFLogic BooleanSort -> QFLogic BooleanSort # join :: QFLogic BooleanSort -> QFLogic BooleanSort -> QFLogic BooleanSort #
MeetSemiLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression Methods (/\) :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort # meet :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort #
MeetSemiLattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression Methods (/\) :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort # meet :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort #
MeetSemiLattice (Lia BooleanSort) #
Instance details Defined in Data.Expression Methods (/\) :: Lia BooleanSort -> Lia BooleanSort -> Lia BooleanSort # meet :: Lia BooleanSort -> Lia BooleanSort -> Lia BooleanSort #
MeetSemiLattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression Methods (/\) :: QFLia BooleanSort -> QFLia BooleanSort -> QFLia BooleanSort # meet :: QFLia BooleanSort -> QFLia BooleanSort -> QFLia BooleanSort #
MeetSemiLattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression Methods (/\) :: QFLogic BooleanSort -> QFLogic BooleanSort -> QFLogic BooleanSort # meet :: QFLogic BooleanSort -> QFLogic BooleanSort -> QFLogic BooleanSort #
Lattice (ALia BooleanSort) #
Instance details Defined in Data.Expression
Lattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression
Lattice (Lia BooleanSort) #
Instance details Defined in Data.Expression
Lattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression
Lattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression
BoundedJoinSemiLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression Methods bottom :: ALia BooleanSort #
BoundedJoinSemiLattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression Methods bottom :: QFALia BooleanSort #
BoundedJoinSemiLattice (Lia BooleanSort) #
Instance details Defined in Data.Expression Methods bottom :: Lia BooleanSort #
BoundedJoinSemiLattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression Methods bottom :: QFLia BooleanSort #
BoundedJoinSemiLattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression Methods bottom :: QFLogic BooleanSort #
BoundedMeetSemiLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression Methods top :: ALia BooleanSort #
BoundedMeetSemiLattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression Methods top :: QFALia BooleanSort #
BoundedMeetSemiLattice (Lia BooleanSort) #
Instance details Defined in Data.Expression Methods top :: Lia BooleanSort #
BoundedMeetSemiLattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression Methods top :: QFLia BooleanSort #
BoundedMeetSemiLattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression Methods top :: QFLogic BooleanSort #
BoundedLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression
BoundedLattice (QFALia BooleanSort) #
Instance details Defined in Data.Expression
BoundedLattice (Lia BooleanSort) #
Instance details Defined in Data.Expression
BoundedLattice (QFLia BooleanSort) #
Instance details Defined in Data.Expression
BoundedLattice (QFLogic BooleanSort) #
Instance details Defined in Data.Expression
ComplementedLattice (ALia BooleanSort) Source #
Instance details Defined in Data.Expression Methods complement :: ALia BooleanSort -> ALia BooleanSort Source #
ComplementedLattice (QFALia BooleanSort) Source #
Instance details Defined in Data.Expression Methods complement :: QFALia BooleanSort -> QFALia BooleanSort Source #
ComplementedLattice (Lia BooleanSort) Source #
Instance details Defined in Data.Expression Methods complement :: Lia BooleanSort -> Lia BooleanSort Source #
ComplementedLattice (QFLia BooleanSort) Source #
Instance details Defined in Data.Expression Methods complement :: QFLia BooleanSort -> QFLia BooleanSort Source #
ComplementedLattice (QFLogic BooleanSort) Source #
Instance details Defined in Data.Expression Methods complement :: QFLogic BooleanSort -> QFLogic BooleanSort Source #
(Parseable f h, Parseable g h) => Parseable (f :+: g :: k1 -> k2 -> *) h Source #
Instance details Defined in Data.Expression.Parser Methods parser :: Proxy (f :+: g) -> Parser (DynamicallySorted h) -> Parser (DynamicallySorted h) Source #

class (IFunctor f, IFunctor g) => f :<: g where Source #

Inclusion relation for indexed sum functors

Minimal complete definition

inj, prj

Methods

inj :: f a i -> g a i Source #

prj :: g a i -> Maybe (f a i) Source #

Instances

IFunctor f => (f :: (i -> ) -> i -> ) :<: (f :: (i -> ) -> i -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods inj :: f a i0 -> f a i0 Source # prj :: f a i0 -> Maybe (f a i0) Source #
(IFunctor f, IFunctor g, IFunctor h, f :<: g) => (f :: (k -> ) -> k -> ) :<: (h :+: g :: (k -> ) -> k -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods inj :: f a i -> (h :+: g) a i Source # prj :: (h :+: g) a i -> Maybe (f a i) Source #
(IFunctor f, IFunctor g) => (f :: (k -> ) -> k -> ) :<: (f :+: g :: (k -> ) -> k -> ) Source #
Instance details Defined in Data.Expression.Utils.Indexed.Sum Methods inj :: f a i -> (f :+: g) a i Source # prj :: (f :+: g) a i -> Maybe (f a i) Source #

inject :: g :<: f => forall i. g (IFix f) i -> IFix f i Source #

Inject a component into a sum.

match :: g :<: f => forall i. IFix f i -> Maybe (g (IFix f) i) Source #

Try to unpack a sum into a component.