Updated forth.jl installation instructions.

[scheme.forth.jl.git] / README.md

diff --git a/README.md b/README.md
index 5f318a9..7551d57 100644 (file)
--- a/README.md
+++ b/README.md
@@ -1,5 +1,5 @@
 scheme.forth.jl
 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
 
 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


@@ -17,20 +17,15 @@ C to forth, but also includes:
 * a basic (non-hygienic) macro system and
 * first-class continuations via `call-with-current-continuation`.
 
 * a basic (non-hygienic) macro system and
 * first-class continuations via `call-with-current-continuation`.
 

-In future, I plan to also implement 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/).
-

 Running the interpreter
 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
-forth.jl using the following command:
+To run this Scheme interpreter, first open Julia (forth.jl requires
+**version >=1.0**) from the src directory contained in this
+repository.  If you've not done so already, install forth.jl using the
+Julia package manager (accessed using the `]` key):

 
 

-    julia> Pkg.clone("https://github.com/tgvaughan/forth.jl")
+    (v1.0) pkg> add https://github.com/tgvaughan/forth.jl

 
 Then, import and run the Forth system:
 
 
 Then, import and run the Forth system:
 


@@ -59,7 +54,7 @@ At this point you can start entering Scheme commands.  For example,
     ; 120
 
 Metacircular Evaluator
     ; 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
 
 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


@@ -108,7 +103,7 @@ recursive list append procedure:
 You may have to wait a minute or so for the final result to be printed.
 
 License
 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
 
 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