| Copyright | Anders Claesson 2013 |
|---|---|
| Maintainer | Anders Claesson <anders.claesson@gmail.com> |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
Sym.Permgram
Description
Permutation diagrams, or permutations as monads.
Data types
type Label a = Vector a Source #
The purpose of this data type is to assign labels to the indices of a given permutation.
A permgram consists of a permutation together with a label for each index of the permutation.
Instances
| Applicative Permgram Source # | |
| Functor Permgram Source # | |
| Monad Permgram Source # | |
| Show a => Show (Permgram a) Source # | |
| Eq a => Eq (Permgram a) Source # | |
| Ord a => Ord (Permgram a) Source # | |