diff --git a/docsrc/content/abstraction-alternative.fsx b/docsrc/content/abstraction-alternative.fsx
index c44440264..e72041d5f 100644
--- a/docsrc/content/abstraction-alternative.fsx
+++ b/docsrc/content/abstraction-alternative.fsx
@@ -6,8 +6,10 @@
 (**
 Alternative
 ===========
+
 Applicative Functors which also have a monoid structure.
 ___
+
 Minimal complete definition
 ---------------------------
  * ``return x``   /   ``result x``
diff --git a/docsrc/content/abstraction-applicative.fsx b/docsrc/content/abstraction-applicative.fsx
index acdc554b7..3758b575f 100644
--- a/docsrc/content/abstraction-applicative.fsx
+++ b/docsrc/content/abstraction-applicative.fsx
@@ -6,8 +6,10 @@
 (**
 Applicative
 ===========
+
 A functor with application, providing operations to embed pure expressions (``return``), and sequence computations and combine their results (``<*>``).
 ___
+
 Minimal complete definition
 ---------------------------
  * ``return x`` &nbsp; / &nbsp; ``result x``
diff --git a/docsrc/content/abstraction-functor.fsx b/docsrc/content/abstraction-functor.fsx
index be70ca172..4bd0e7671 100644
--- a/docsrc/content/abstraction-functor.fsx
+++ b/docsrc/content/abstraction-functor.fsx
@@ -6,8 +6,10 @@
 (**
 Functor
 =======
+
 The Functor abstraction is used for types that can be mapped over.
 ___
+
 Minimal complete definition
 ---------------------------
  * ``map f x`` &nbsp; / &nbsp; ``(|>>) x f`` &nbsp; / &nbsp; ``(<<|) f x`` &nbsp; / &nbsp; ``(<!>) f x``
diff --git a/docsrc/content/abstraction-monoid.fsx b/docsrc/content/abstraction-monoid.fsx
index 25c467606..45c0088bd 100644
--- a/docsrc/content/abstraction-monoid.fsx
+++ b/docsrc/content/abstraction-monoid.fsx
@@ -7,7 +7,9 @@
 Monoid
 ======
 Types with an associative binary operation that has an identity.
+
 ___
+
 Minimal complete definition
 ---------------------------
  * `zero``
diff --git a/docsrc/content/abstraction-semigroup.fsx b/docsrc/content/abstraction-semigroup.fsx
index 649e2c9c1..f80d67107 100644
--- a/docsrc/content/abstraction-semigroup.fsx
+++ b/docsrc/content/abstraction-semigroup.fsx
@@ -5,8 +5,10 @@
 (**
 Semigroup
 =========
+
 In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.
 ___
+
 Minimal complete definition
 ---------------------------
  * ``(+)`` &nbsp; / &nbsp; ``(++)``
diff --git a/docsrc/content/abstraction-zipapplicative.fsx b/docsrc/content/abstraction-zipapplicative.fsx
index 056795cfb..6a5dde11b 100644
--- a/docsrc/content/abstraction-zipapplicative.fsx
+++ b/docsrc/content/abstraction-zipapplicative.fsx
@@ -7,7 +7,9 @@
 Zip Applicative (aka Non-sequential Applicative)
 ================================================
 A functor with application, providing operations to embed pure expressions (``pur``), run computations pointwise and/or paralell and combine their results (``<.>``).
+
 ___
+
 Minimal complete definition
 ---------------------------
  * ``pur x`` &nbsp;