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

diff --git a/README.md b/README.md
index 7f18e76..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
@@ -8,20 +8,17 @@ life as a fairly direct port of Peter Micheaux's [Bootstrap
 Scheme](https://github.com/petermichaux/bootstrap-scheme) (as described in
 [this wonderful series of blog
 posts](http://peter.michaux.ca/articles/scheme-from-scratch-introduction)) from
-C to forth, but also includes pre-evaluation syntactic analysis, variadic
-compound function support, mark-sweep garbage collection, quasiquotation, a
-basic (non-hygienic) macro system and first-class continuations via
-`call-with-current-continuation`.
+C to forth, but also includes:
 
-In future, I plan to also implement reified continuations and a more
-complete numerical tower to bring it closer to
-[R5RS](http://www.schemers.org/Documents/Standards/R5RS/).
-
-The goal is for the interpreter to be complete enough to be used to complete
-the majority of the exercises found in [SICP](http://sarabander.github.io/sicp/).
+* variadic compound function support,
+* pre-evaluation syntactic analysis,
+* mark-sweep garbage collection,
+* quasiquotation,
+* a basic (non-hygienic) macro system and
+* 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
@@ -56,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
@@ -105,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