Category theory/Natural transformation
From HaskellWiki
(Difference between revisions)
m (Fix empty line tricks at tables) |
m (Vertical arrows: sides of objects: rephrase non-scientific expression) |
||
| Line 15: | Line 15: | ||
=== Vertical arrows: sides of objects === | === Vertical arrows: sides of objects === | ||
| - | … showing | + | … showing how the natural transformation works. |
:<math>\eta : \Phi \to \Psi</math> | :<math>\eta : \Phi \to \Psi</math> | ||
Revision as of 20:12, 2 October 2006
Contents |
1 Example: maybeToList
maybeToList
map even $ maybeToList $ Just 5
yields the same as
maybeToList $ map even $ Just 5
yields: both yield
[False]
1.1 Vertical arrows: sides of objects
… showing how the natural transformation works.
maybeToList :: Maybe a -> [a]
1.1.1 Left: side of X object
| maybeToList :: Maybe Int -> [Int] | |
| Nothing | [] |
| Just 0 | [0] |
| Just 1 | [1] |
1.1.2 Right: side of Y object
| maybeToList :: Maybe Bool -> [Bool] | |
| Nothing | [] |
| Just True | [True] |
| Just False | [False] |
1.2 Horizontal arrows: sides of functors
even :: Int -> Bool
1.2.1 Side of Φ functor
| map even:: Maybe Int -> Maybe Bool | |
| Nothing | Nothing |
| Just 0 | Just True |
| Just 1 | Just False |
1.2.2 Side of Ψ functor
| map even:: [Int] -> [Bool] | |
| [] | [] |
| [0] | [True] |
| [1] | [False] |
1.3 Commutativity of the diagram
both paths span between
Maybe Int -> [Bool] | ||
| map even . maybeToList | maybeToList . map even | |
| Nothing | [] | [] |
| Just 0 | [True] | [True] |
| Just 1 | [False] | [False] |
1.4 Remarks
- has a more general type (even) than described hereIntegral a => a -> Bool
- Words “side”, “horizontal”, “vertical”, “left”, “right” serve here only to point to the discussed parts of a diagram, thus, they are not part of the scientific terminology.
