Data.Decidable

class Decidable :: (Type -> Type) -> Constraintclass (Decide f, Divisible f) <= Decidable f  where

Decidable is the contravariant analogue of Alternative.

Members

• lose :: forall a. (a -> Void) -> f a

Instances

• Decidable Comparison
• Decidable Equivalence
• Decidable Predicate
• (Monoid r) => Decidable (Op r)

lost :: forall f. Decidable f => f Void