Copyright | (c) Erich Gut |
---|---|
License | BSD3 |
Maintainer | zerich.gut@gmail.com |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
natural transformations between Diagram
s.
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 Diagram
s.
Property Let
be in
Transformation
a b t
for a Transformation
t n m aMultiplicative
structure a
,
then holds
.dgQuiver
a==
dgQuiver
b- For all
0
holds:<=
i<
n
whereorientation
(t i)==
p i:>
q ip =
anddgPoints
aq =
.dgPoints
b - For all
0
holds:<=
j<
mt (e j)
where*
f j==
g j*
t (s j)f =
,dgArrows
ag =
,dgArrows
bs j
is the index of the start point of thej
-th arrow ande j
is 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)
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.