Copyright	Anders Claesson 2013
Maintainer	Anders Claesson <anders.claesson@gmail.com>
Safe Haskell	Safe-Inferred
Language	Haskell2010

Sym.Permgram

Contents

Description

Permutation diagrams, or permutations as monads.

Synopsis

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 details

Applicative Permgram Source #
Instance details Defined in Sym.Permgram Methods pure :: a -> Permgram a # (<>) :: Permgram (a -> b) -> Permgram a -> Permgram b # liftA2 :: (a -> b -> c) -> Permgram a -> Permgram b -> Permgram c # (>) :: Permgram a -> Permgram b -> Permgram b # (<*) :: Permgram a -> Permgram b -> Permgram a #
Functor Permgram Source #
Instance details Defined in Sym.Permgram Methods fmap :: (a -> b) -> Permgram a -> Permgram b # (<$) :: a -> Permgram b -> Permgram a #
Monad Permgram Source #
Instance details Defined in Sym.Permgram Methods (>>=) :: Permgram a -> (a -> Permgram b) -> Permgram b # (>>) :: Permgram a -> Permgram b -> Permgram b # return :: a -> Permgram a #
Show a => Show (Permgram a) Source #
Instance details Defined in Sym.Permgram Methods showsPrec :: Int -> Permgram a -> ShowS # show :: Permgram a -> String # showList :: [Permgram a] -> ShowS #
Eq a => Eq (Permgram a) Source #
Instance details Defined in Sym.Permgram Methods (==) :: Permgram a -> Permgram a -> Bool # (/=) :: Permgram a -> Permgram a -> Bool #
Ord a => Ord (Permgram a) Source #
Instance details Defined in Sym.Permgram Methods compare :: Permgram a -> Permgram a -> Ordering # (<) :: Permgram a -> Permgram a -> Bool # (<=) :: Permgram a -> Permgram a -> Bool # (>) :: Permgram a -> Permgram a -> Bool # (>=) :: Permgram a -> Permgram a -> Bool # max :: Permgram a -> Permgram a -> Permgram a # min :: Permgram a -> Permgram a -> Permgram a #

Accessors

The underlying permutation.

The assignment of labels to indices.

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

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

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