diff --git a/content/blog/01_types_basics.md b/content/blog/01_types_basics.md
index 0dee2fa..59e11bc 100644
--- a/content/blog/01_types_basics.md
+++ b/content/blog/01_types_basics.md
@@ -329,8 +329,8 @@ above. I've provided the rules for numbers; the rules for strings should be quit
 similar.<br>
 <br>
 In Bergamot, the claim that an expression <code>e</code> has type <code>t</code>
-is written as <code>type(e, t)</code>. A rule looks like <code>RuleName @ conclusion <- premise1, premise2;</code>.
-Thus, the rule <pre><code>TNumber @ type(lit(?n), number) <- num(?n);
+is written as <code>type(e, t)</code>. A rule looks like <code>RuleName @ conclusion &lt;- premise1, premise2;</code>.
+Thus, the rule <pre><code>TNumber @ type(lit(?n), number) &lt;- num(?n);
 </code></pre>
 Has one premise, that the term \(n\) is a number, and the conclusion is that
 a number literal has type \(\text{number}\). The <code>num</code> condition