Copyright	(C) 2017-18 Jakub Daniel
License	BSD-style (see the file LICENSE)
Maintainer	Jakub Daniel <[email protected]>
Stability	experimental
Safe Haskell	None
Language	Haskell2010

Data.Expression.Array

Description

Synopsis

data ArrayF a (s :: Sort) where
- Select :: Sing i -> Sing e -> a (ArraySort i e) -> a i -> ArrayF a e
- Store :: Sing i -> Sing e -> a (ArraySort i e) -> a i -> a e -> ArrayF a (ArraySort i e)
select :: (ArrayF :<: f, SingI i, SingI e) => IFix f (ArraySort i e) -> IFix f i -> IFix f e
store :: (ArrayF :<: f, SingI i, SingI e) => IFix f (ArraySort i e) -> IFix f i -> IFix f e -> IFix f (ArraySort i e)

Documentation

data ArrayF a (s :: Sort) where Source #

A functor representing array-theoretic terms (select and store also known as "read" and "write")

Constructors

Select :: Sing i -> Sing e -> a (ArraySort i e) -> a i -> ArrayF a e
Store :: Sing i -> Sing e -> a (ArraySort i e) -> a i -> a e -> ArrayF a (ArraySort i e)

Instances

IEq1 ArrayF Source #
Instance details Defined in Data.Expression.Array Methods ieq1 :: IEq a => ArrayF a j -> ArrayF a j -> Bool Source #
IFoldable ArrayF Source #
Instance details Defined in Data.Expression.Array Methods ifold :: Monoid m => ArrayF (Const m) i' -> Const m i' Source #
IFunctor ArrayF Source #
Instance details Defined in Data.Expression.Array Methods imap :: (forall (i' :: i). a i' -> b i') -> forall (i' :: i). ArrayF a i' -> ArrayF b i' Source # index :: ArrayF a i' -> Sing i' Source #
ITraversable ArrayF Source #
Instance details Defined in Data.Expression.Array Methods itraverse :: Applicative f => (forall (i' :: i). a i' -> f (b i')) -> forall (i' :: i). ArrayF a i' -> f (ArrayF b i') Source #
IShow ArrayF Source #
Instance details Defined in Data.Expression.Array Methods ishow :: ArrayF (Const String) i -> Const String i Source #
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 #
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 #
Lattice (ALia BooleanSort) #
Instance details Defined in Data.Expression
Lattice (QFALia 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 #
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 #
BoundedLattice (ALia BooleanSort) #
Instance details Defined in Data.Expression
BoundedLattice (QFALia 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 #
ArrayF :<: f => Parseable ArrayF f Source #
Instance details Defined in Data.Expression.Array Methods parser :: Proxy ArrayF -> Parser (DynamicallySorted f) -> Parser (DynamicallySorted f) Source #

select :: (ArrayF :<: f, SingI i, SingI e) => IFix f (ArraySort i e) -> IFix f i -> IFix f e Source #

A smart constructor for select

store :: (ArrayF :<: f, SingI i, SingI e) => IFix f (ArraySort i e) -> IFix f i -> IFix f e -> IFix f (ArraySort i e) Source #

A smart constructor for store