Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
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.Basis.Maybe | |
Avoidable Stack Source # | |
Defined in Pandora.Paradigm.Structure.Specific.Stack | |
Avoidable t => Avoidable (Yoneda t) Source # | |
Defined in Pandora.Paradigm.Basis.Yoneda | |
Avoidable t => Avoidable (Jack t) Source # | |
Defined in Pandora.Paradigm.Basis.Jack | |
Avoidable t => Avoidable (Free t) Source # | |
Defined in Pandora.Paradigm.Basis.Free |