diff --git a/share/doc/papers/malloc/implementation.ms b/share/doc/papers/malloc/implementation.ms
index 3641191f980a..14ae9d2c8c17 100644
--- a/share/doc/papers/malloc/implementation.ms
+++ b/share/doc/papers/malloc/implementation.ms
@@ -6,7 +6,7 @@
 .\" this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
 .\" ----------------------------------------------------------------------------
 .\"
-.\" $Id: implementation.ms,v 1.1 1996/04/13 08:30:13 phk Exp $
+.\" $Id: implementation.ms,v 1.2 1996/09/29 18:36:11 phk Exp $
 .\"
 .ds RH Implementation
 .NH
@@ -119,7 +119,7 @@ It's not that surprising after all, it's the difference between
 following the crowd or actively directing where it can go, in both
 ways you can end up in the middle of it all.
 .PP
-The sideffect of this compromise is that it also uses less storage,
+The side effect of this compromise is that it also uses less storage,
 and the list never has to be reordered, all the ordering happens when
 pages are added or deleted.
 .PP
diff --git a/share/doc/papers/malloc/malloc.ms b/share/doc/papers/malloc/malloc.ms
index 0bc40d902c0f..6837c9f6b277 100644
--- a/share/doc/papers/malloc/malloc.ms
+++ b/share/doc/papers/malloc/malloc.ms
@@ -6,7 +6,7 @@
 .\" this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
 .\" ----------------------------------------------------------------------------
 .\"
-.\" $Id: malloc.ms,v 1.1 1996/04/13 08:30:17 phk Exp $
+.\" $Id: malloc.ms,v 1.2 1996/09/29 18:36:13 phk Exp $
 .\"
 .ds RH Malloc and free
 .NH
@@ -50,7 +50,7 @@ put the small structure used to contain the next and previous pointers
 plus the state of the chunk right before the chunk itself.
 .PP
 As a matter of fact, the canonical malloc(3) implementation can be 
-studied in the ``Old testament'', chapter 8 verse 7 [Kernighan & Rich ie]
+studied in the ``Old testament'', chapter 8 verse 7 [Kernighan & Ritchie]
 .PP
 Various optimisations can be applied to the above basic algorithm:
 .IP