X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=advanced_topics%2Fmonads_in_category_theory.mdwn;h=4941e80b99875eb3f9179c704da83e63d4d3ae66;hb=4f87cdd50334c5d9dddbdad136fac4008d8ce6ff;hp=c0d4bf7f8cc08712dcd6f3824aadf0f2ae59c6f9;hpb=86c716d4c3d50b20cd1fbf426e139c07629641aa;p=lambda.git
diff --git a/advanced_topics/monads_in_category_theory.mdwn b/advanced_topics/monads_in_category_theory.mdwn
index c0d4bf7f..4941e80b 100644
--- a/advanced_topics/monads_in_category_theory.mdwn
+++ b/advanced_topics/monads_in_category_theory.mdwn
@@ -202,15 +202,19 @@ Let φ
and γ
be members of `T`, that is they
Since composition is associative I don't specify the order of composition on the rhs.
-In other words, `<=<` is a binary operator that takes us from two members φ
and γ
of `T` to a composite natural transformation. (In functional programming, at least, this is called the "Kleisli composition operator". Sometimes it's written φ >=> γ
where that's the same as γ <=< φ
.)
+In other words, `<=<` is a binary operator that takes us from two members φ
and γ
of `T` to a composite natural transformation. (In functional programming, at least, this is called the "Kleisli composition operator". Sometimes it's written φ >=> γ
where that's the same as γ <=< φ
.)
-φ
is a transformation from `F` to `MF'`, where the latter = `MG`; (M γ)
is a transformation from `MG` to `MMG'`; and `(join G')` is a transformation from `MMG'` to `MG'`. So the composite γ <=< φ
will be a transformation from `F` to `MG'`, and so also eligible to be a member of `T`.
+φ
is a transformation from `F` to `MF'`, where the latter = `MG`; (M γ)
is a transformation from `MG` to `MMG'`; and `(join G')` is a transformation from `MMG'` to `MG'`. So the composite γ <=< φ
will be a transformation from `F` to `MG'`, and so also eligible to be a member of `T`.
Now we can specify the "monad laws" governing a monad as follows:
+
(T, <=<, unit) constitute a monoid ++ +That's it. Well, there may be a wrinkle here. -That's it. Well, there may be a wrinkle here. I don't know whether the definition of a monoid requires the operation to be defined for every pair in its set. In the present case,
γ <=< φ
isn't fully defined on `T`, but only when φ
is a transformation to some `MF'` and γ
is a transformation from `F'`. But wherever `<=<` is defined, the monoid laws are satisfied:
+I don't know whether the definition of a monoid requires the operation to be defined for every pair in its set. In the present case, γ <=< φ
isn't fully defined on `T`, but only when φ
is a transformation to some `MF'` and γ
is a transformation from `F'`. But wherever `<=<` is defined, the monoid laws are satisfied:
(i) γ <=< φ is also in T