{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE DeriveDataTypeable #-}
#if __GLASGOW_HASKELL__ < 709
{-# LANGUAGE Trustworthy #-}
#else
{-# LANGUAGE Safe #-}
#endif
module Algebra.Lattice.Op (
Op(..)
) where
#ifndef MIN_VERSION_base
#define MIN_VERSION_base(x,y,z) 1
#endif
import Algebra.Lattice
import Algebra.PartialOrd
#if MIN_VERSION_base(4,8,0)
#else
import Control.Applicative
import Data.Foldable
import Data.Traversable
#endif
import Control.DeepSeq
import Control.Monad
import Data.Data
import Data.Hashable
import GHC.Generics
newtype Op a = Op { getOp :: a }
deriving ( Eq, Ord, Show, Read, Data, Typeable, Generic
#if __GLASGOW_HASKELL__ >= 706
, Generic1
#endif
)
instance Foldable Op where
foldMap f (Op a) = f a
instance Traversable Op where
traverse f (Op a) = Op <$> f a
instance Functor Op where
fmap f (Op a) = Op (f a)
instance Applicative Op where
pure = return
(<*>) = ap
instance Monad Op where
return = Op
Op x >>= f = f x
instance NFData a => NFData (Op a) where
rnf (Op a) = rnf a
instance Hashable a => Hashable (Op a)
instance MeetSemiLattice a => JoinSemiLattice (Op a) where
Op x \/ Op y = Op (x /\ y)
instance JoinSemiLattice a => MeetSemiLattice (Op a) where
Op x /\ Op y = Op (x \/ y)
instance (Lattice a, Ord a) => Lattice (Op a) where
instance BoundedMeetSemiLattice a => BoundedJoinSemiLattice (Op a) where
bottom = Op top
instance BoundedJoinSemiLattice a => BoundedMeetSemiLattice (Op a) where
top = Op bottom
instance (BoundedLattice a, Ord a, Bounded a) => BoundedLattice (Op a) where
instance PartialOrd a => PartialOrd (Op a) where
Op a `leq` Op b = b `leq` a