mirror of
https://github.com/rjNemo/functional-programming-jargon
synced 2026-06-10 12:36:48 +00:00
commit
68d104f387
1 changed files with 1 additions and 1 deletions
|
|
@ -331,7 +331,7 @@ To be a valid category 3 rules must be met:
|
||||||
and `f` is a morphism from `a -> b`, and `g` is a morphism from `b -> c`;
|
and `f` is a morphism from `a -> b`, and `g` is a morphism from `b -> c`;
|
||||||
`g(f(x))` must be equivalent to `(g • f)(x)`.
|
`g(f(x))` must be equivalent to `(g • f)(x)`.
|
||||||
3. Composition must be associative
|
3. Composition must be associative
|
||||||
`f • (g • h)` is the same as `(f • g) * h`
|
`f • (g • h)` is the same as `(f • g) • h`
|
||||||
|
|
||||||
Since these rules govern composition at very abstract level, category theory is great at uncovering new ways of composing things.
|
Since these rules govern composition at very abstract level, category theory is great at uncovering new ways of composing things.
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue