algebra-3.1: Constructive abstract algebra

Safe Haskell | None

Numeric.Order.LocallyFinite

# Documentation

class Order a => LocallyFiniteOrder a where Source

Methods

range :: a -> a -> [a]Source

rangeSize :: a -> a -> Natural Source

moebiusInversion :: Ring r => a -> a -> rSource

Instances

LocallyFiniteOrder Bool |
LocallyFiniteOrder Int |
LocallyFiniteOrder Int8 |
LocallyFiniteOrder Int16 |
LocallyFiniteOrder Int32 |
LocallyFiniteOrder Int64 |
LocallyFiniteOrder Integer |
LocallyFiniteOrder Word |
LocallyFiniteOrder Word8 |
LocallyFiniteOrder Word16 |
LocallyFiniteOrder Word32 |
LocallyFiniteOrder Word64 |
LocallyFiniteOrder () |
LocallyFiniteOrder Natural |
Ord a => LocallyFiniteOrder (Set a) |
(LocallyFiniteOrder a, LocallyFiniteOrder b) => LocallyFiniteOrder (a, b) |
(LocallyFiniteOrder a, LocallyFiniteOrder b, LocallyFiniteOrder c) => LocallyFiniteOrder (a, b, c) |
(LocallyFiniteOrder a, LocallyFiniteOrder b, LocallyFiniteOrder c, LocallyFiniteOrder d) => LocallyFiniteOrder (a, b, c, d) |
(LocallyFiniteOrder a, LocallyFiniteOrder b, LocallyFiniteOrder c, LocallyFiniteOrder d, LocallyFiniteOrder e) => LocallyFiniteOrder (a, b, c, d, e) |