pandora-0.1.7: 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 <+> idle ≡ x
* Right absorption: idle <+> x ≡ x

Methods

idle :: t a Source #

Instances
Avoidable Maybe Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

Methods

idle :: Maybe a Source #

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

Defined in Pandora.Paradigm.Basis.Yoneda

Methods

idle :: Yoneda t a Source #

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

Defined in Pandora.Paradigm.Basis.Free

Methods

idle :: Free t a Source #

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

Defined in Pandora.Paradigm.Basis.Jack

Methods

idle :: Jack t a Source #

(Covariant (t u), Avoidable u) => Avoidable (Y t u) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Transformer

Methods

idle :: Y t u a Source #

(Covariant t, Avoidable u) => Avoidable (T t u) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Transformer

Methods

idle :: T t u a Source #

(Avoidable t, Covariant u) => Avoidable (U Co Co t u) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Composition

Methods

idle :: U Co Co t u a Source #

(Avoidable t, Covariant u, Covariant v) => Avoidable (UU Co Co Co t u v) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Composition

Methods

idle :: UU Co Co Co t u v a Source #

(Avoidable t, Covariant u, Covariant v, Covariant w) => Avoidable (UUU Co Co Co Co t u v w) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Composition

Methods

idle :: UUU Co Co Co Co t u v w a Source #