content/blog/haskell_lazy_evaluation/index.md

@@ -103,17 +103,6 @@ needed to compute the final answer can exist, unsimplified, in the tree.
 Why don't we draw a few graphs to get familiar with the idea?
 
 ### Visualizing Graphs and Their Reduction
-__A word of caution__: the steps presented below may significantly differ
-from the actual graph reduction algorithms used by modern compilers.
-In particular, this section draws a lot of ideas from Simon Peyton Jones' book,
-[_Implementing functional languages: a tutorial_](https://www.microsoft.com/en-us/research/publication/implementing-functional-languages-a-tutorial/).
-However, modern functional compilers (i.e. GHC) use a much more
-complicated abstract machine for evaluating graph-based code,
-based on -- from what I know -- the [spineless tagless G-machine](https://www.microsoft.com/en-us/research/wp-content/uploads/1992/04/spineless-tagless-gmachine.pdf).
-In short, this section, in order to build intuition, walks through how a functional program
-evaluated using graph reduction _may_ behave; the actual details
-depend on the compiler. 
-
 Let's start with something that doesn't have anything fancy. We can
 take a look at the graph of the expression:
 

themes/vanilla/assets/scss/code.scss

@@ -28,7 +28,6 @@ pre code {
         border: $code-border;
         display: block;
         overflow: auto;
-        margin-bottom: 1rem;
 
         td {
             padding: 0;