Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Synopsis
- class Alternative t => Avoidable t where
- idle :: t a
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
Instances
Avoidable Maybe Source # | |
Defined in Pandora.Paradigm.Basis.Maybe | |
Avoidable t => Avoidable (Yoneda t) Source # | |
Defined in Pandora.Paradigm.Basis.Yoneda | |
Avoidable t => Avoidable (Free t) Source # | |
Defined in Pandora.Paradigm.Basis.Free | |
Avoidable t => Avoidable (Jack t) Source # | |
Defined in Pandora.Paradigm.Basis.Jack | |
(Covariant (t u), Avoidable u) => Avoidable (Y t u) Source # | |
Defined in Pandora.Paradigm.Junction.Transformer | |
(Covariant t, Avoidable u) => Avoidable (T t u) Source # | |
Defined in Pandora.Paradigm.Junction.Transformer | |
(Avoidable t, Covariant u) => Avoidable (U Co Co t u) Source # | |
(Avoidable t, Covariant u, Covariant v) => Avoidable (UU Co Co Co t u v) Source # | |
(Avoidable t, Covariant u, Covariant v, Covariant w) => Avoidable (UUU Co Co Co Co t u v w) Source # | |