| Copyright | (c) Erich Gut |
|---|---|
| License | BSD3 |
| Maintainer | zerich.gut@gmail.com |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
OAlg.Entity.Diagram.Transformation
Contents
Description
natural transformations between Diagrams.
Synopsis
- data Transformation t n m a = Transformation (Diagram t n m a) (Diagram t n m a) (FinList n a)
- trfs :: Transformation t n m a -> FinList n a
- coTransformation :: Transformation t n m a -> Dual (Transformation t n m a)
Transformation
data Transformation t n m a Source #
natural transformations between two Diagrams.
Property Let be in
Transformation a b t for a Transformation t n m aMultiplicative structure a,
then holds
.dgQuivera==dgQuiverb- For all
0holds:<=i<nwhereorientation(t i)==p i:>q ip =anddgPointsaq =.dgPointsb - For all
0holds:<=j<mt (e j)where*f j==g j*t (s j)f =,dgArrowsag =,dgArrowsbs jis the index of the start point of thej-th arrow ande jis the index of the end point.
t (s j)
s j p (s j) --------> q (s j)
| | |
j | f j | | g j
| | |
v v v
e j p (e j) --------> q (e j)
t (e j)
Constructors
| Transformation (Diagram t n m a) (Diagram t n m a) (FinList n a) |
Instances
trfs :: Transformation t n m a -> FinList n a Source #
the underlying list of factors.
Duality
coTransformation :: Transformation t n m a -> Dual (Transformation t n m a) Source #
the dual transformation.