| Copyright | (c) Erich Gut |
|---|---|
| License | BSD3 |
| Maintainer | zerich.gut@gmail.com |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
OAlg.Entity.Sequence
Description
Sequences of indexed items in a type x with an index type i and there
permutations. We consider two kinds of sequences:
- Complete
- Sequences
x 0,x 1,x 2,..with an integral index typeiwhere there indices don't have wholes and start at0, e.g.[x]or free products of symbols inxi.e.ProductSymbol. - Partial
- Sequences
x i0,x i1,x i2,..with a totally ordered index typeiwhere there indices allow wholes, e.g.PSequence,Set,Graph.
Furthermore there are total right operations of Permutation defined on them which
permutes the corresponding indices to yield a new sequence.