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

Description

Synopsis

Documentation

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

A functor representing a conditional value (if-then-else)

Constructors

IfThenElse :: Sing s -> a BooleanSort -> a s -> a s -> IfThenElseF a s

Instances

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

Lattice (QFALia BooleanSort) #

Lattice (Lia BooleanSort) #

Lattice (QFLia BooleanSort) #

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

BoundedLattice (QFALia BooleanSort) #

BoundedLattice (Lia BooleanSort) #

BoundedLattice (QFLia BooleanSort) #

ComplementedLattice (ALia BooleanSort) Source #
Methods complement :: ALia BooleanSort -> ALia BooleanSort Source #
ComplementedLattice (QFALia BooleanSort) Source #
Methods complement :: QFALia BooleanSort -> QFALia BooleanSort Source #
ComplementedLattice (Lia BooleanSort) Source #
Methods complement :: Lia BooleanSort -> Lia BooleanSort Source #
ComplementedLattice (QFLia BooleanSort) Source #
Methods complement :: QFLia BooleanSort -> QFLia BooleanSort Source #
(:<:) Sort IfThenElseF f => Parseable ((Sort -> ) -> Sort -> ) IfThenElseF f Source #
Methods parser :: Proxy IfThenElseF f -> Parser (DynamicallySorted g) -> Parser (DynamicallySorted g) Source #

ite :: forall f s. (IfThenElseF :<: f, SingI s) => IFix f BooleanSort -> IFix f s -> IFix f s -> IFix f s Source #

A smart constructor for an if-then-else expression