X-Git-Url: https://thelambdalab.xyz/gitweb/index.cgi?p=scheme.forth.jl.git;a=blobdiff_plain;f=README.md;h=8f7f12ece52cfbb9e7975bff817e8949a1092e1b;hp=0a861b9d609e10a1788bade63c844325063c5a08;hb=ed191ba289bdcd6c0aa2e1079e63e8069ca6965c;hpb=e1a4719549029d88e1409a1fbf074e96cce6e6e5

diff --git a/README.md b/README.md
index 0a861b9..8f7f12e 100644
--- a/README.md
+++ b/README.md
@@ -75,12 +75,12 @@ You'll then be greeted by the following prompt:
     ;; M-Eval input:
 
 At this point you can start entering Scheme commands... but be prepared to wait
-a while for the result.  After all, when evaluating commands in the MCE you are
+a while for each result.  After all, when evaluating commands in the MCE you are
 running a program in a Scheme interpreter running inside another Scheme
 interpreter which is itself running on a Forth system that is implemented atop
-the Julia numerical computing environment.  **That's three levels of
-abstraction more than a native Julia program experiences**, so some delay is to
-be expected!
+a virtual register machine running in the Julia numerical computing
+environment.  **That's four levels of abstraction more than a native Julia
+program experiences**, so some delay is to be expected!
 
 For instance, the following example from SICP defines and demonstrates a
 recursive list append procedure: