Merge branch 'doc'

README.markdown

@@ -173,12 +173,10 @@ summary files generated by criterion. To demonstrate the criterion
 mode, we write a small Haskell program that benchmarks a simple
 definition of the [factorial] function:
 
-~~~ { .Haskell }
-import Criterion.Main
-
-main = defaultMain [bgroup "fac" [bench (show n) (nf product [1..n]) | n <- ns]]
- where ns = [10^4 * k | k <- [1,2,3]] :: [Integer]
-~~~
+    import Criterion.Main
+
+    main = defaultMain [bgroup "fac" [bench (show n) (nf product [1..n]) | n <- ns]]
+     where ns = [10^4 * k | k <- [1,2,3]] :: [Integer]
 
 We can compile this program, generate a benchmark summary using
 criterion, and visualise it using barchart as follows:
@@ -196,10 +194,8 @@ We can now modify the program to use an explicitly recursive
 definition of the fibonacci function to see whether this affects the
 run times.
 
-~~~ { .Haskell }
-fac 0 = 1
-fac n = n * fac (n-1)
-~~~
+    fac 0 = 1
+    fac n = n * fac (n-1)
 
 After generating another summary file `factorial2.csv` we could
 generate another bar chart to visualise it and view both charts side
@@ -245,16 +241,14 @@ generate bar charts from CSV files generated by progression.
 We can alter the factorial program as follows to generate
 progression's data:
 
-~~~ { .Haskell }
-import Criterion
-import Progression.Main
-
-main = defaultMain (bgroup "fac" [bench (show n) (nf fac n) | n <- ns])
- where ns = [10^4 * k | k <- [1,2,3]] :: [Integer]
-
-fac 0 = 1
-fac n = n * fac (n-1)
-~~~
+    import Criterion
+    import Progression.Main
+
+    main = defaultMain (bgroup "fac" [bench (show n) (nf fac n) | n <- ns])
+     where ns = [10^4 * k | k <- [1,2,3]] :: [Integer]
+
+    fac 0 = 1
+    fac n = n * fac (n-1)
 
 We do not need to change the fibonacci function itself because we
 won't execute benchmarks using progression. We only generate a