X-Git-Url: https://thelambdalab.xyz/gitweb/index.cgi?p=scheme.forth.jl.git;a=blobdiff_plain;f=README.md;h=62f932b1c5461d85e2c24bad5452817b17f90201;hp=f2cc92e6a75cc2e9b96ca30f2e0f2828c2b773c4;hb=cad27d3e4fdb70234a450244349f9234f48a924b;hpb=50e62272f0453640f022a8dfb70b21c705fda841

diff --git a/README.md b/README.md
index f2cc92e..62f932b 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,5 @@
 scheme.forth.jl
----------------
+===============
 
 A hobby Scheme interpreter for FORTH 83. Specifically it is targeted at
 [forth.jl](http://github.com/tgvaughan/forth.jl) which is an implementation of
@@ -18,7 +18,7 @@ C to forth, but also includes:
 * first-class continuations via `call-with-current-continuation`.
 
 Running the interpreter
-=======================
+-----------------------
 
 To run this Scheme interpreter, first open Julia (**version >=0.6**) from the src
 directory contained in this repository.  If you've not done so already, install
@@ -53,7 +53,7 @@ At this point you can start entering Scheme commands.  For example,
     ; 120
 
 Metacircular Evaluator
-======================
+----------------------
 
 Of course, one of the things you can do in Scheme (or of course any programming
 language, this is the fundamental thing) is implement an interpreter for
@@ -102,7 +102,7 @@ recursive list append procedure:
 You may have to wait a minute or so for the final result to be printed.
 
 License
-=======
+-------
 
 This software is free (as in freedom) and is distributed under the terms
 of version 3 of the GNU General Public License.  A copy of this license