Data.Permgram

Permutation diagrams, or permutations as monads.

Data types

type Label a = Array Int a

The purpose of this data type is to assign labels to the indices of a given permutation.

data Permgram a

A permgram consists of a permutation together with a label for each index of the permutation.

Instances

Monad Permgram

Functor Permgram

Eq a => Eq (Permgram a)

Ord a => Ord (Permgram a)

Show a => Show (Permgram a)

Accessors

perm :: Permgram a -> Perm

The underlying permutation.

label :: Permgram a -> Label a

The assignment of labels to indices.

size :: Permgram a -> Int

The size of a permgram is the size of the underlying permutation.

Construct permgrams

permgram :: Perm -> [a] -> Permgram a

Construct a permgram from an underlying permutation and a list of labels.

inverse :: Permgram a -> Permgram a

The inverse permgram. It's obtained by mirroring the permgram in the x=y diagonal.