UMinho Haskell Libraries (2006.06.14)ContentsIndex
Data.Relation.Taxonomy
Contents
Point free relations
Synopsis
isReflexive :: Ord a => Rel a a -> Bool
isCoreflexive :: Ord a => Rel a a -> Bool
isSimple :: (Ord a, Ord b) => Rel a b -> Bool
isEntire :: (Ord a, Ord b) => Rel a b -> Bool
isInjective :: (Ord a, Ord b) => Rel a b -> Bool
isSurjective :: (Ord a, Ord b) => Rel a b -> Bool
isRepresentation :: (Ord a, Ord b) => Rel a b -> Bool
isFunction :: (Ord a, Ord b) => Rel a b -> Bool
isAbstraction :: (Ord a, Ord b) => Rel a b -> Bool
isInjection :: (Ord a, Ord b) => Rel a b -> Bool
isSurjection :: (Ord a, Ord b) => Rel a b -> Bool
isBijection :: (Ord a, Ord b) => Rel a b -> Bool
Point free relations
isReflexive :: Ord a => Rel a a -> Bool
Test whether relation is reflexive.
isCoreflexive :: Ord a => Rel a a -> Bool
Test whether relation is coreflexive.
isSimple :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is simple.
isEntire :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is entire.
isInjective :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is injective.
isSurjective :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is surjective.
isRepresentation :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is a representation.
isFunction :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is functional.
isAbstraction :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is an abstraction.
isInjection :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is an injective function.
isSurjection :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is a surjective function.
isBijection :: (Ord a, Ord b) => Rel a b -> Bool
Test whether relation is an isomorphism.
Produced by Haddock version 0.7