pandora-0.3.1: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Pattern.Functor.Avoidable

Synopsis

Documentation

class Alternative t => Avoidable t where Source #

When providing a new instance, you should ensure it satisfies the two laws:
* Left absorption: x <+> empty ≡ x
* Right absorption: empty <+> x ≡ x

Methods

empty :: t a Source #

Instances
Avoidable Maybe Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

empty :: Maybe a Source #

Avoidable t => Avoidable (Yoneda t) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Yoneda

Methods

empty :: Yoneda t a Source #

Avoidable t => Avoidable (Jack t) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Jack

Methods

empty :: Jack t a Source #

Avoidable t => Avoidable (Instruction t) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Instruction

Methods

empty :: Instruction t a Source #

Avoidable u => Avoidable ((((->) s :: Type -> Type) <:<.>:> (:*:) s) := u) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.State

Methods

empty :: (((->) s <:<.>:> (:*:) s) := u) a Source #

(Covariant t, Avoidable u) => Avoidable (u <:.> Construction t) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Methods

empty :: (u <:.> Construction t) a Source #