Data.Monoid.Disj

newtype Disj a

Monoid and semigroup for disjunction.

Disj x <> Disj y == Disj (x || y)
(mempty :: Disj _) == Disj bottom

Constructors

• Disj a

Instances

• (Eq a) => Eq (Disj a)
• Eq1 Disj
• (Ord a) => Ord (Disj a)
• Ord1 Disj
• (Bounded a) => Bounded (Disj a)
• (Show a) => Show (Disj a)
• Functor Disj
• Apply Disj
• Applicative Disj
• Bind Disj
• Monad Disj
• (HeytingAlgebra a) => Semigroup (Disj a)
• (HeytingAlgebra a) => Monoid (Disj a)
• (HeytingAlgebra a) => Semiring (Disj a)