Portability | requires multi-parameter type classes |
---|---|

Stability | provisional |

Maintainer | numericprelude@henning-thielemann.de |

Safe Haskell | Safe-Infered |

- newtype Cycle i = Cycle {
- cycle :: [i]

- data T i = Cons {}
- fromCycles :: (i, i) -> [[i]] -> T i
- toCycles :: T i -> [[i]]
- toTable :: Ix i => T i -> T i
- fromTable :: Ix i => T i -> T i
- errIncompat :: a
- liftCmpTable2 :: Ix i => (T i -> T i -> a) -> T i -> T i -> a
- liftTable2 :: Ix i => (T i -> T i -> T i) -> T i -> T i -> T i
- closure :: Ix i => [T i] -> [T i]

# Documentation

We shall make a little bit of a hack here, enabling us to use additive or multiplicative syntax for groups as we wish by simply instantiating Num with both operations corresponding to the group operation of the permutation group we're studying

There are quite a few way we could represent elements of permutation groups: the images in a row, a list of the cycles, et.c. All of these differ highly in how complex various operations end up being.

fromCycles :: (i, i) -> [[i]] -> T iSource

Does not check whether the input values are in range.

errIncompat :: aSource