Minor edits.

diff --git a/docs/misc/Document.md b/docs/misc/Document.md
index 5c9387b..065276a 100644 (file)
--- a/docs/misc/Document.md
+++ b/docs/misc/Document.md
@@ -273,7 +273,7 @@ Which then becomes this:
 
     5 1 >> u sqr u
 
-The interpreter could notice that `5 1 >>` and `u sqr` can proceed in parallel without interfering with each other.  The `dipdip` combinator could be written to somehow hint to the interpreter that it should check for this posibility.
+The interpreter could notice that `5 1 >>` and `u sqr` can proceed in parallel without interfering with each other.  The `dipdip` combinator could be written to somehow hint to the interpreter that it should check for this possibility.
 
 
 ## JIT

diff --git a/docs/misc/neat-talk.txt b/docs/misc/neat-talk.txt
index c286e9c..73509d5 100644 (file)
--- a/docs/misc/neat-talk.txt
+++ b/docs/misc/neat-talk.txt
@@ -1,8 +1,8 @@
+Great talk from Jon Purdy in 2017, he wrote Kitten.
+Concatenative Programming: From Ivory to Metal
 https://www.youtube.com/watch?v=_IgqJr8jG8M
 
-Concatenative Programming: From Ivory to Metal
 
-Great talk from Jon Purdy in 2017, he wrote Kitten.
 
 "Complete and Easy Bidirectional Typechecking
 for Higher-Rank Polymorphism"

diff --git a/docs/reference/pow.md b/docs/reference/pow.md
index 9d439a3..46901fb 100644 (file)
--- a/docs/reference/pow.md
+++ b/docs/reference/pow.md
@@ -4,8 +4,8 @@
 
 Basis Function
 
-Take two numbers `a` and `b` from the stack and raise `a` to the `n`th
-power.  (`b` is on the top of the stack.)
+Take two numbers `a` and `n` from the stack and raise `a` to the `n`th
+power.  (`n` is on the top of the stack.)
 
        a n pow
     -------------

diff --git a/implementations/uvm-ncc/joy_types.c b/implementations/uvm-ncc/joy_types.c
index 5f74b25..9835c0c 100644 (file)
--- a/implementations/uvm-ncc/joy_types.c
+++ b/implementations/uvm-ncc/joy_types.c
@@ -300,7 +300,7 @@ ht_insert(char *symbol)
        while (candidate) {
                // Compare pointers then hashes (since we already have
                // one hash I'm guessing that that's cheaper or at least
-               // no more expensive than string comparision.)
+               // no more expensive than string comparison.)
                if (candidate == symbol || hash == hash_key(candidate))
                        break;
                index = (index + increment) % CAPACITY;
@@ -356,6 +356,7 @@ push_symbol(char *symbol, u32 stack)
 {
        return cons(JOY_VALUE(joySymbol, ht_insert(symbol)), stack);
 }
+
 u32
 push_int(u32 n, u32 stack)
 {