Safe Haskell	None
Language	Haskell2010

Language.Expression.Choice

Synopsis

data OpChoice ops (t :: * -> *) a where
- OpThis :: op t a -> OpChoice (op ': ops) t a
- OpThat :: OpChoice ops t a -> OpChoice (op ': ops) t a
_OpThis :: Prism' (OpChoice (op ': ops) t a) (op t a)
_OpThat :: Prism' (OpChoice (op ': ops) t a) (OpChoice ops t a)
noOps :: OpChoice '[] t a -> x
newtype AsOp (t :: * -> *) a op = AsOp (op t a)
choiceToUnion :: OpChoice ops t a -> Union (AsOp t a) ops
unionToChoice :: Union (AsOp t a) ops -> OpChoice ops t a
_OpChoice :: Iso (OpChoice ops t a) (OpChoice ops' t' a') (Union (AsOp t a) ops) (Union (AsOp t' a') ops')
class ChooseOp op ops where
- chooseOp :: Prism' (OpChoice ops t a) (op t a)
class SubsetOp ops1 ops2 where
- subsetOp :: Prism' (OpChoice ops2 t a) (OpChoice ops1 t a)
newtype HFree' ops v a = HFree' {
- getHFree' :: HFree (OpChoice ops) v a
}
squashExpression :: (HFunctor op1, HFunctor op2, HFunctor (OpChoice ops), ChooseOp op1 ops, ChooseOp op2 ops) => HFree op1 (HFree op2 v) a -> HFree' ops v a
hwrap' :: (HFunctor op, HFunctor (OpChoice ops), ChooseOp op ops) => op (HFree' ops v) a -> HFree' ops v a

Documentation

data OpChoice ops (t :: * -> *) a where Source #

Form the union of a list of operators. This creates an operator which is a choice from one of its constituents.

For example, OpChoice '[NumOp, EqOp] is an operator that can either represent an arithmetic operation or an equality comparison.

Constructors

OpThis :: op t a -> OpChoice (op ': ops) t a
OpThat :: OpChoice ops t a -> OpChoice (op ': ops) t a

Instances

Instances details

(HFoldableAt k op, HFoldableAt k (OpChoice ops)) => HFoldableAt (k :: Type -> Type) (OpChoice (op ': ops) :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods hfoldMap :: forall t (a :: k0). (forall (b :: k0). t b -> k b) -> OpChoice (op ': ops) t a -> k a Source #
HFoldableAt (k :: Type -> Type) (OpChoice ('[] :: [(Type -> Type) -> Type -> Type])) Source #
Instance details Defined in Language.Expression.Choice Methods hfoldMap :: forall t (a :: k0). (forall (b :: k0). t b -> k b) -> OpChoice '[] t a -> k a Source #
(HTraversable op, HTraversable (OpChoice ops)) => HTraversable (OpChoice (op ': ops) :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods htraverse :: forall f t t' (a :: u). Applicative f => (forall (b :: u). t b -> f (t' b)) -> OpChoice (op ': ops) t a -> f (OpChoice (op ': ops) t' a) Source # hsequence :: forall f (t :: u -> Type) (a :: u). Applicative f => OpChoice (op ': ops) (Compose f t) a -> f (OpChoice (op ': ops) t a) Source #
HTraversable (OpChoice ('[] :: [(Type -> Type) -> Type -> Type])) Source #
Instance details Defined in Language.Expression.Choice Methods htraverse :: forall f t t' (a :: u). Applicative f => (forall (b :: u). t b -> f (t' b)) -> OpChoice '[] t a -> f (OpChoice '[] t' a) Source # hsequence :: forall f (t :: u -> Type) (a :: u). Applicative f => OpChoice '[] (Compose f t) a -> f (OpChoice '[] t a) Source #
(HFunctor op, HFunctor (OpChoice ops)) => HFunctor (OpChoice (op ': ops) :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods hmap :: forall t t' (a :: u). (forall (b :: u). t b -> t' b) -> OpChoice (op ': ops) t a -> OpChoice (op ': ops) t' a Source #
HFunctor (OpChoice ('[] :: [(Type -> Type) -> Type -> Type])) Source #
Instance details Defined in Language.Expression.Choice Methods hmap :: forall t t' (a :: u). (forall (b :: u). t b -> t' b) -> OpChoice '[] t a -> OpChoice '[] t' a Source #
(Pretty2 op, Pretty2 (OpChoice ops)) => Pretty2 (OpChoice (op ': ops) :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Pretty Methods pretty2 :: forall (t :: k -> Type) (a :: k). Pretty1 t => OpChoice (op ': ops) t a -> String Source # prettys2Prec :: forall (t :: k -> Type) (a :: k). Pretty1 t => Int -> OpChoice (op ': ops) t a -> ShowS Source #
Pretty2 (OpChoice ('[] :: [(Type -> Type) -> Type -> Type])) Source #
Instance details Defined in Language.Expression.Pretty Methods pretty2 :: forall (t :: k -> Type) (a :: k). Pretty1 t => OpChoice '[] t a -> String Source # prettys2Prec :: forall (t :: k -> Type) (a :: k). Pretty1 t => Int -> OpChoice '[] t a -> ShowS Source #

_OpThis :: Prism' (OpChoice (op ': ops) t a) (op t a) Source #

_OpThat :: Prism' (OpChoice (op ': ops) t a) (OpChoice ops t a) Source #

noOps :: OpChoice '[] t a -> x Source #

newtype AsOp (t :: * -> *) a op Source #

Constructors

AsOp (op t a)

Instances

Instances details

Wrapped (AsOp t a op) Source #
Instance details Defined in Language.Expression.Choice Associated Types type Unwrapped (AsOp t a op) # Methods _Wrapped' :: Iso' (AsOp t a op) (Unwrapped (AsOp t a op)) #
AsOp t1 a1 op1 ~ t2 => Rewrapped (AsOp t3 a2 op2) t2 Source #
Instance details Defined in Language.Expression.Choice
type Unwrapped (AsOp t a op) Source #
Instance details Defined in Language.Expression.Choice type Unwrapped (AsOp t a op) = op t a

choiceToUnion :: OpChoice ops t a -> Union (AsOp t a) ops Source #

unionToChoice :: Union (AsOp t a) ops -> OpChoice ops t a Source #

_OpChoice :: Iso (OpChoice ops t a) (OpChoice ops' t' a') (Union (AsOp t a) ops) (Union (AsOp t' a') ops') Source #

class ChooseOp op ops where Source #

This class provides a low-boilerplate way of lifting individual operators into a union, and extracting operators from a union.

Methods

chooseOp :: Prism' (OpChoice ops t a) (op t a) Source #

Project a single operator from a union which contains it.

Instances

Instances details

UElem op ops i => ChooseOp op ops Source #
Instance details Defined in Language.Expression.Choice Methods chooseOp :: forall (t :: Type -> Type) a. Prism' (OpChoice ops t a) (op t a) Source #

class SubsetOp ops1 ops2 where Source #

Methods

subsetOp :: Prism' (OpChoice ops2 t a) (OpChoice ops1 t a) Source #

Instances

Instances details

USubset ops1 ops2 is => SubsetOp ops1 ops2 Source #
Instance details Defined in Language.Expression.Choice Methods subsetOp :: forall (t :: Type -> Type) a. Prism' (OpChoice ops2 t a) (OpChoice ops1 t a) Source #

newtype HFree' ops v a Source #

HFree' ops v a is a higher-order free monad over the list of operators ops with variables in the type v and it represents a value of type a.

Intuitively, it represents an expression which may contain operations from any of the operators in the list ops.

Constructors

HFree'
Fields getHFree' :: HFree (OpChoice ops) v a

Instances

Instances details

(HFoldableAt k (OpChoice ops), HFunctor (OpChoice ops)) => HFoldableAt (k :: Type -> Type) (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods hfoldMap :: forall t (a :: k0). (forall (b :: k0). t b -> k b) -> HFree' ops t a -> k a Source #
HTraversable (OpChoice ops) => HTraversable (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods htraverse :: forall f t t' (a :: u). Applicative f => (forall (b :: u). t b -> f (t' b)) -> HFree' ops t a -> f (HFree' ops t' a) Source # hsequence :: forall f (t :: u -> Type) (a :: u). Applicative f => HFree' ops (Compose f t) a -> f (HFree' ops t a) Source #
HFunctor (OpChoice ops) => HMonad (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice
HFunctor (OpChoice ops) => HBind (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods (^>>=) :: forall t (a :: k) (t' :: k -> Type). HFree' ops t a -> (forall (b :: k). t b -> HFree' ops t' b) -> HFree' ops t' a Source #
HPointed (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods hpure :: forall t (a :: k). t a -> HFree' ops t a Source #
HFunctor (OpChoice ops) => HFunctor (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Choice Methods hmap :: forall t t' (a :: u). (forall (b :: u). t b -> t' b) -> HFree' ops t a -> HFree' ops t' a Source #
Pretty2 (OpChoice ops) => Pretty2 (HFree' ops :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in Language.Expression.Pretty Methods pretty2 :: forall (t :: k -> Type) (a :: k). Pretty1 t => HFree' ops t a -> String Source # prettys2Prec :: forall (t :: k -> Type) (a :: k). Pretty1 t => Int -> HFree' ops t a -> ShowS Source #
(Data (HFree (OpChoice ops) v a), Typeable (HFree' ops v a)) => Data (HFree' ops v a) Source #
Instance details Defined in Language.Expression.Choice Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HFree' ops v a -> c (HFree' ops v a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HFree' ops v a) # toConstr :: HFree' ops v a -> Constr # dataTypeOf :: HFree' ops v a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HFree' ops v a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HFree' ops v a)) # gmapT :: (forall b. Data b => b -> b) -> HFree' ops v a -> HFree' ops v a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HFree' ops v a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HFree' ops v a -> r # gmapQ :: (forall d. Data d => d -> u) -> HFree' ops v a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HFree' ops v a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HFree' ops v a -> m (HFree' ops v a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HFree' ops v a -> m (HFree' ops v a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HFree' ops v a -> m (HFree' ops v a) #
Wrapped (HFree' ops v a) Source #
Instance details Defined in Language.Expression.Choice Associated Types type Unwrapped (HFree' ops v a) # Methods _Wrapped' :: Iso' (HFree' ops v a) (Unwrapped (HFree' ops v a)) #
HFree' ops1 v1 a1 ~ t => Rewrapped (HFree' ops2 v2 a2) t Source #
Instance details Defined in Language.Expression.Choice
type Unwrapped (HFree' ops v a) Source #
Instance details Defined in Language.Expression.Choice type Unwrapped (HFree' ops v a) = HFree (OpChoice ops) v a

squashExpression :: (HFunctor op1, HFunctor op2, HFunctor (OpChoice ops), ChooseOp op1 ops, ChooseOp op2 ops) => HFree op1 (HFree op2 v) a -> HFree' ops v a Source #

Squash a composition of expressions over different operators into a single-layered expression over a choice of the two operators.

hwrap' :: (HFunctor op, HFunctor (OpChoice ops), ChooseOp op ops) => op (HFree' ops v) a -> HFree' ops v a Source #