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

Copyright(c) Henning Thielemann 2006
Maintainernumericprelude@henning-thielemann.de
Stabilityprovisional
PortabilityRoutines and abstractions for permutations of Integers.
Safe HaskellSafe
LanguageHaskell98

MathObj.Permutation

Description

  • ** Seems to be a candidate for Algebra directory. Algebra.PermutationGroup ?
Synopsis
  • class C p where

    Documentation

    class C p where Source #

    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.

    Minimal complete definition

    domain, apply, inverse

    Methods

    domain :: Ix i => p i -> (i, i) Source #

    apply :: Ix i => p i -> i -> i Source #

    inverse :: Ix i => p i -> p i Source #

    Instances
    C T Source # 
    Instance details

    Defined in MathObj.Permutation.CycleList.Check

    Methods

    domain :: Ix i => T i -> (i, i) Source #

    apply :: Ix i => T i -> i -> i Source #

    inverse :: Ix i => T i -> T i Source #