From fd2c52ec9129e2886b5f09381efb25d49fa3bc6d Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Tue, 2 Nov 2010 08:04:10 -0400
Subject: [PATCH] cat theory tweaks

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---
 advanced_topics/monads_in_category_theory.mdwn | 29 +++++++-------------------
 1 file changed, 7 insertions(+), 22 deletions(-)

diff --git a/advanced_topics/monads_in_category_theory.mdwn b/advanced_topics/monads_in_category_theory.mdwn
index 74b5d572..316d0274 100644
--- a/advanced_topics/monads_in_category_theory.mdwn
+++ b/advanced_topics/monads_in_category_theory.mdwn
@@ -21,28 +21,13 @@ Monoids
 -------
 A **monoid** is a structure `(S, *, z)` consisting of an associative binary operation `*` over some set `S`, which is closed under `*`, and which contains an identity element `z` for `*`. That is:
 
-<pre>this is
-my pre-only
-block
-</pre>
-
-<code>this is
-my code-only
-block
-</pre>
-
-<blockquote>this is
-my bq-only
-block
-</blockquote>
-
 
-<blockquote><pre>
-for all `s1`, `s2`, `s3` in `S`:
-(i) `s1*s2` etc are also in `S`
-(ii) `(s1*s2)*s3` = `s1*(s2*s3)`
+<blockquote>
+for all `s1`, `s2`, `s3` in `S`:<BR>
+(i) `s1*s2` etc are also in `S`<BR>
+(ii) `(s1*s2)*s3` = `s1*(s2*s3)`<BR>
 (iii) `z*s1` = `s1` = `s1*z`
-</pre></blockquote>
+</blockquote>
 
 Some examples of monoids are:
 
@@ -60,8 +45,8 @@ When a morphism `f` in category **C** has source `C1` and target `C2`, we'll wri
 To have a category, the elements and morphisms have to satisfy some constraints:
 
 <blockquote><pre>
-(i) the class of morphisms has to be closed under composition: where `f:C1->C2` and `g:C2->C3`, `g o f` is also a morphism of the category, which maps `C1->C3`.
-(ii) composition of morphisms has to be associative
+(i) the class of morphisms has to be closed under composition: where `f:C1->C2` and `g:C2->C3`, `g o f` is also a morphism of the category, which maps `C1->C3`.<BR>
+(ii) composition of morphisms has to be associative<BR>
 (iii) every element `E` of the category has to have an identity morphism 1<sub>E</sub>, which is such that for every morphism `f:C1->C2`: 1<sub>C2</sub> o f = f = f o 1<sub>C1</sub>
 </pre></blockquote>
 
-- 
2.11.0