FiniteCategories-0.2.0.0: Finite categories and usual categorical constructions on them.
CopyrightGuillaume Sabbagh 2022
LicenseGPL-3
Maintainerguillaumesabbagh@protonmail.com
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell2010

Math.Categories.OrdinalCategory

Description

An OrdinalCategory is a TotalOrder category where the total order is an order induced by ordinal numbers.

Concretely the type parameter must implement the Enum typeclass.

For example, the TotalOrder category induced by (R,<=) is not an OrdinalCategory whereas (N,<=) is.

It induces a non trivial generating set of arrows thanks to the succ function.

Synopsis

Documentation

newtype OrdinalCategory a Source #

An OrdinalCategory is a TotalOrder where the type a follows the Enum typeclass.

Constructors

OrdinalCategory (TotalOrder a) 

Instances

Instances details
Eq (OrdinalCategory a) Source # 
Instance details

Defined in Math.Categories.OrdinalCategory

Methods

(==) :: OrdinalCategory a -> OrdinalCategory a -> Bool

(/=) :: OrdinalCategory a -> OrdinalCategory a -> Bool

Show (OrdinalCategory a) Source # 
Instance details

Defined in Math.Categories.OrdinalCategory

Methods

showsPrec :: Int -> OrdinalCategory a -> ShowS

show :: OrdinalCategory a -> String

showList :: [OrdinalCategory a] -> ShowS

Show a => PrettyPrint (OrdinalCategory a) Source # 
Instance details

Defined in Math.Categories.OrdinalCategory

(Enum a, Ord a) => Category (OrdinalCategory a) (IsSmallerThan a) a Source # 
Instance details

Defined in Math.Categories.OrdinalCategory