Pandora.Pattern.Functor.Avoidable

Documentation

class Alternative t => Avoidable t where

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

Instances

Avoidable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

empty :: Maybe a

Avoidable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

empty :: Stack a

Avoidable t => Avoidable (Yoneda t)

Defined in Pandora.Paradigm.Basis.Yoneda

Methods

empty :: Yoneda t a

Avoidable t => Avoidable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

empty :: Free t a

Avoidable t => Avoidable (Jack t)

Defined in Pandora.Paradigm.Basis.Jack

Methods

empty :: Jack t a

(Avoidable t, Covariant u) => Avoidable (TU Co Co t u)

Defined in Pandora.Pattern.Junction.Schemes.TU

Methods

empty :: TU Co Co t u a

(Covariant (t u), Avoidable u) => Avoidable (UTU Co Co t u)

Defined in Pandora.Pattern.Junction.Schemes.UTU

Methods

empty :: UTU Co Co t u a

(Covariant t, Avoidable u) => Avoidable (UT Co Co t u)

Defined in Pandora.Pattern.Junction.Schemes.UT

Methods

empty :: UT Co Co t u a

(Avoidable t, Covariant u, Covariant v) => Avoidable (TUV Co Co Co t u v)

Defined in Pandora.Pattern.Junction.Schemes.TUV

Methods

empty :: TUV Co Co Co t u v a

(Avoidable t, Covariant u, Covariant v, Covariant w) => Avoidable (TUVW Co Co Co Co t u v w)

Defined in Pandora.Pattern.Junction.Schemes.TUVW

Methods

empty :: TUVW Co Co Co Co t u v w a