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.Array

Description

Synopsis

Documentation

data ArrayF a s 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

IFoldable Sort ArrayF Source #
Methods ifold :: Monoid m => f (Const ArrayF m) i' -> Const ArrayF m i' Source #
IEq1 Sort ArrayF Source #
Methods ieq1 :: IEq ArrayF a => f a j -> f a j -> Bool Source #
IFunctor Sort ArrayF Source #
Methods imap :: (forall i'. a i' -> b i') -> forall i'. f a i' -> f b i' Source # index :: f a i' -> Sing ArrayF i' Source #
ITraversable Sort ArrayF Source #
Methods itraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source #
IShow Sort Sort ArrayF Source #
Methods ishow :: f (Const k String) i -> Const ArrayF String i Source #
JoinSemiLattice (ALia BooleanSort) #
Methods (\/) :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort # join :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort #
JoinSemiLattice (QFALia BooleanSort) #
Methods (\/) :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort # join :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort #
MeetSemiLattice (ALia BooleanSort) #
Methods (/\) :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort # meet :: ALia BooleanSort -> ALia BooleanSort -> ALia BooleanSort #
MeetSemiLattice (QFALia BooleanSort) #
Methods (/\) :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort # meet :: QFALia BooleanSort -> QFALia BooleanSort -> QFALia BooleanSort #
Lattice (ALia BooleanSort) #

Lattice (QFALia BooleanSort) #

BoundedJoinSemiLattice (ALia BooleanSort) #
Methods bottom :: ALia BooleanSort #
BoundedJoinSemiLattice (QFALia BooleanSort) #
Methods bottom :: QFALia BooleanSort #
BoundedMeetSemiLattice (ALia BooleanSort) #
Methods top :: ALia BooleanSort #
BoundedMeetSemiLattice (QFALia BooleanSort) #
Methods top :: QFALia BooleanSort #
BoundedLattice (ALia BooleanSort) #

BoundedLattice (QFALia BooleanSort) #

ComplementedLattice (ALia BooleanSort) Source #
Methods complement :: ALia BooleanSort -> ALia BooleanSort Source #
ComplementedLattice (QFALia BooleanSort) Source #
Methods complement :: QFALia BooleanSort -> QFALia BooleanSort Source #
(:<:) Sort ArrayF f => Parseable ((Sort -> ) -> Sort -> ) ArrayF f Source #
Methods parser :: Proxy ArrayF f -> Parser (DynamicallySorted g) -> Parser (DynamicallySorted g) 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