Inline math html rendering experiment 1

chapter1/functional-lecture01.md

@@ -100,7 +100,7 @@ $$ {{{\frac{\,}{a} \tiny{x}} \atop {\text{\textbar}}} \atop {b}} \text{, \ \ or
    {{{\frac{\,}{a} \tiny{x}} \atop {\text{\textbar}}} \atop {c}} $$
 
 match any subtree that derives $b$ (or $c$) and can use $a$ (by assumption 
-$\frac{\,}{a} \tiny{x}$) although otherwise $a$ might not be warranted. 
+$ \frac{\,}{a} \tiny{x}$) although otherwise $a$ might not be warranted. 
 For example:
 
 $$ \frac{\frac{\frac{\frac{\frac{\,}{\text{sunny}} \small{x}}{\text{go
@@ -216,7 +216,7 @@ type int_string_record = {a: int; b: string}
   and create its values: `{a = 7; b = "Mary"}`.
 * We access the *fields* of records using the dot notation:
 
-  `{a=7; b="Mary"}.b = "Mary"`.Recursive expression $\text{{\texttt{rec}} } x 
+  `{a=7; b="Mary"}.b = "Mary"`.Recursive expression $ \text{{\texttt{rec}} } x 
 \text{{\texttt{=}}} e$ in the table was cheating: `rec` (usually 
 called `fix`) cannot appear alone in OCaml! It must be part of a definition.
 

old_lectures_as_book.md

@@ -116,7 +116,7 @@ $$ {{{\frac{\,}{a} \tiny{x}} \atop {\text{\textbar}}} \atop {b}} \text{, \ \ or
    {{{\frac{\,}{a} \tiny{x}} \atop {\text{\textbar}}} \atop {c}} $$
 
 match any subtree that derives $b$ (or $c$) and can use $a$ (by assumption 
-$\frac{\,}{a} \tiny{x}$) although otherwise $a$ might not be warranted. 
+$ \frac{\,}{a} \tiny{x}$) although otherwise $a$ might not be warranted. 
 For example:
 
 $$ \frac{\frac{\frac{\frac{\frac{\,}{\text{sunny}} \small{x}}{\text{go
@@ -232,7 +232,7 @@ type int_string_record = {a: int; b: string}
   and create its values: `{a = 7; b = "Mary"}`.
 * We access the *fields* of records using the dot notation:
 
-  `{a=7; b="Mary"}.b = "Mary"`.Recursive expression $\text{{\texttt{rec}} } x 
+  `{a=7; b="Mary"}.b = "Mary"`.Recursive expression $ \text{{\texttt{rec}} } x 
 \text{{\texttt{=}}} e$ in the table was cheating: `rec` (usually 
 called `fix`) cannot appear alone in OCaml! It must be part of a definition.
 

site/old_lectures_as_book.html

@@ -401,10 +401,9 @@ <h1 id="in-the-beginning-there-was-logos">1 In the Beginning there was
 <p>match any subtree that derives <span
 class="math inline"><em>b</em></span> (or <span
 class="math inline"><em>c</em></span>) and can use <span
-class="math inline"><em>a</em></span> (by assumption <span
-class="math inline">$\frac{\,}{a} \tiny{x}$</span>) although otherwise
-<span class="math inline"><em>a</em></span> might not be warranted. For
-example:</p>
+class="math inline"><em>a</em></span> (by assumption $ {x}$) although
+otherwise <span class="math inline"><em>a</em></span> might not be
+warranted. For example:</p>
 <p><span class="math display">$$
 \frac{\frac{\frac{\frac{\frac{\,}{\text{sunny}} \small{x}}{\text{go
    outdoor}}}{\text{playing}}}{\text{happy}}}{\text{sunny} \rightarrow
@@ -583,9 +582,8 @@ <h2 id="definitions">3.1 Definitions</h2>
 class="sourceCode ocaml"><code class="sourceCode ocaml"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a><span class="kw">type</span> int_string_record = {a: <span class="dt">int</span>; b: <span class="dt">string</span>}</span></code></pre></div>
 <p>and create its values: <code>{a = 7; b = "Mary"}</code>. * We access
 the <em>fields</em> of records using the dot notation:</p>
-<p><code>{a=7; b="Mary"}.b = "Mary"</code>.Recursive expression <span
-class="math inline">$\text{{\texttt{rec}} } x \text{{\texttt{=}}}
-e$</span> in the table was cheating: <code>rec</code> (usually called
+<p><code>{a=7; b="Mary"}.b = "Mary"</code>.Recursive expression $ x e$
+in the table was cheating: <code>rec</code> (usually called
 <code>fix</code>) cannot appear alone in OCaml! It must be part of a
 definition.</p>
 <p><strong>Definitions for expressions</strong> are introduced by rules