| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Semigroup.Meet
Contents
Synopsis
- type (-) (g :: k1 -> k) (f :: k -> k2) (a :: k1) = f (g a)
- newtype Meet a = Meet {
- unMeet :: a
- type MeetSemilattice a = (Prd a, (Meet - Semigroup) a)
- (∧) :: (Meet - Semigroup) a => a -> a -> a
- top :: (Meet - Monoid) a => a
- meetLeq :: Eq a => (Meet - Semigroup) a => a -> a -> Bool
- meetGeq :: Eq a => (Meet - Semigroup) a => a -> a -> Bool
- pcompareMeet :: Eq a => (Meet - Semigroup) a => a -> a -> Maybe Ordering
Documentation
Instances
(∧) :: (Meet - Semigroup) a => a -> a -> a infixr 6 Source #
Meet operation on a semilattice.
>>>(> (0::Int)) ∧ ((< 10) ∨ (== 15)) $ 15True