numeric-prelude-0.4.3: An experimental alternative hierarchy of numeric type classes

Safe HaskellNone
LanguageHaskell98

Algebra.Lattice

Documentation

class C a where #

Minimal complete definition

up, dn

Methods

up :: a -> a -> a infixl 5 #

dn :: a -> a -> a infixl 5 #

Instances
C Bool # 
Instance details

Defined in Algebra.Lattice

Methods

up :: Bool -> Bool -> Bool #

dn :: Bool -> Bool -> Bool #

C Integer # 
Instance details

Defined in Algebra.Lattice

Methods

up :: Integer -> Integer -> Integer #

dn :: Integer -> Integer -> Integer #

(Ord a, C a) => C (T a) # 
Instance details

Defined in Algebra.Lattice

Methods

up :: T a -> T a -> T a #

dn :: T a -> T a -> T a #

(C a, C b) => C (a, b) # 
Instance details

Defined in Algebra.Lattice

Methods

up :: (a, b) -> (a, b) -> (a, b) #

dn :: (a, b) -> (a, b) -> (a, b) #

max :: C a => a -> a -> a #

min :: C a => a -> a -> a #

abs :: (C a, C a) => a -> a #

propUpCommutative :: (Eq a, C a) => a -> a -> Bool #

propDnCommutative :: (Eq a, C a) => a -> a -> Bool #

propUpAssociative :: (Eq a, C a) => a -> a -> a -> Bool #

propDnAssociative :: (Eq a, C a) => a -> a -> a -> Bool #

propUpDnDistributive :: (Eq a, C a) => a -> a -> a -> Bool #

propDnUpDistributive :: (Eq a, C a) => a -> a -> a -> Bool #