Change <i> tags to <em> in HTML

Author: Gregory Cox

docs/a-fistful-of-monads.html

@@ -101,7 +101,7 @@ <h1 id="a-fistful-of-monads">A Fistful of Monads</h1>
 
 <p>
 Like we said, an applicative value can be seen as a value with an added context.
-A <i>fancy</i> value, to put it in technical terms. For instance, the character
+A <em>fancy</em> value, to put it in technical terms. For instance, the character
 <span class="fixed">'a'</span> is just a normal character, whereas
 <span class="fixed">Just 'a'</span> has some added context. Instead of a
 <span class="fixed">Char</span>, we have a <span class="fixed">Maybe Char</span>,
@@ -152,7 +152,7 @@ <h1 id="a-fistful-of-monads">A Fistful of Monads</h1>
 <span class="fixed">m a</span> instead of <span class="fixed">f a</span> because
 the <span class="fixed">m</span> stands for <span class="fixed">Monad</span>, but monads are just
 applicative functors that support <span class="fixed">&gt;&gt;=</span>. The
-<span class="fixed">&gt;&gt;=</span> function is pronounced as <i>bind</i>.
+<span class="fixed">&gt;&gt;=</span> function is pronounced as <em>bind</em>.
 </p>
 
 <p>

docs/assets/css/style.css

@@ -35,6 +35,9 @@ p {
 a:hover {
     text-decoration:none;
 }
+em {
+    font-style:italic;
+}
 strong {
     font-style:normal;
     font-weight:bold;

docs/functionally-solving-problems.html

@@ -54,7 +54,7 @@ <h2 id="so-whats-haskell">So what’s Haskell?</h2>
 <p>
 <img src="assets/images/introduction/fx.png" class="right" width="150" height="146" alt="fx">
 Haskell is a <strong>purely functional programming language</strong>.
-In imperative languages you get things done by giving the computer a sequence of tasks and then it executes them. While executing them, it can change state. For instance, you set variable <span class="fixed">a</span> to 5 and then do some stuff and then set it to something else. You have control flow structures for doing some action several times. In purely functional programming you don’t tell the computer what to do as such but rather you tell it what stuff <i>is</i>. The factorial of a number is the product of all the numbers from 1 to that number, the sum of a list of numbers is the first number plus the sum of all the other numbers, and so on. You express that in the form of functions. You also can’t set a variable to something and then set it to something else later. If you say that <span class="fixed">a</span> is 5, you can’t say it’s something else later because you just said it was 5. What are you, some kind of liar? So in purely functional languages, a function has no side-effects. The only thing a function can do is calculate something and return it as a result. At first, this seems kind of limiting but it actually has some very nice consequences: if a function is called twice with the same parameters, it’s guaranteed to return the same result. That’s called referential transparency and not only does it allow the compiler to reason about the program’s behavior, but it also allows you to easily deduce (and even prove) that a function is correct and then build more complex functions by gluing simple functions together.
+In imperative languages you get things done by giving the computer a sequence of tasks and then it executes them. While executing them, it can change state. For instance, you set variable <span class="fixed">a</span> to 5 and then do some stuff and then set it to something else. You have control flow structures for doing some action several times. In purely functional programming you don’t tell the computer what to do as such but rather you tell it what stuff <em>is</em>. The factorial of a number is the product of all the numbers from 1 to that number, the sum of a list of numbers is the first number plus the sum of all the other numbers, and so on. You express that in the form of functions. You also can’t set a variable to something and then set it to something else later. If you say that <span class="fixed">a</span> is 5, you can’t say it’s something else later because you just said it was 5. What are you, some kind of liar? So in purely functional languages, a function has no side-effects. The only thing a function can do is calculate something and return it as a result. At first, this seems kind of limiting but it actually has some very nice consequences: if a function is called twice with the same parameters, it’s guaranteed to return the same result. That’s called referential transparency and not only does it allow the compiler to reason about the program’s behavior, but it also allows you to easily deduce (and even prove) that a function is correct and then build more complex functions by gluing simple functions together.
 </p>
 <p>
 <img src="assets/images/introduction/lazy.png" class="right" width="240" height="209" alt="lazy">