| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Pandora.Pattern.Functor.Avoidable
Synopsis
- class Alternative t => Avoidable t where
- empty :: 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 <+> empty ≡ x * Right absorption: empty <+> x ≡ x
Instances
| Avoidable Maybe Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Maybe | |
| Avoidable t => Avoidable (Yoneda t) Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Yoneda | |
| Avoidable t => Avoidable (Jack t) Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Jack | |
| Avoidable t => Avoidable (Instruction t) Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Instruction Methods empty :: Instruction t a Source # | |
| Avoidable (Schematic Monad t u) => Avoidable (t :> u) Source # | |
| (Pointable t, Applicative t, Covariant t', Avoidable u) => Avoidable ((t <:<.>:> t') := u) Source # | |
| (Covariant u, Avoidable t) => Avoidable (t <:.> u) Source # | |
Defined in Pandora.Paradigm.Schemes.TU | |