cat theory tweaks

[lambda.git] / advanced_topics / monads_in_category_theory.mdwn

diff --git a/advanced_topics/monads_in_category_theory.mdwn b/advanced_topics/monads_in_category_theory.mdwn
index c0d4bf7..2b433d2 100644 (file)
--- a/advanced_topics/monads_in_category_theory.mdwn
+++ b/advanced_topics/monads_in_category_theory.mdwn
@@ -208,9 +208,17 @@ In other words, `<=<` is a binary operator that takes us from two members <code>
 
 Now we can specify the "monad laws" governing a monad as follows:
 
+<pre>  
        (T, <=<, unit) constitute a monoid
+</pre>
+
+That's it. Well, there may be a wrinkle here.
+
+`test`
+
+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, <code>&gamma; <=< &phi;</code> isn't fully defined on `T`, but only when <code>&phi;</code> is a transformation to some `MF'` and <code>&gamma;</code> is a transformation from `F'`. But wherever `<=<` is defined, the monoid laws are satisfied:
 
-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, <code>&gamma; <=< &phi;</code> isn't fully defined on `T`, but only when <code>&phi;</code> is a transformation to some `MF'` and <code>&gamma;</code> is a transformation from `F'`. But wherever `<=<` is defined, the monoid laws are satisfied:
+`test`
 
 <pre>
            (i) &gamma; <=< &phi; is also in T