diff --git a/006_hindley_milner.md b/006_hindley_milner.md
index b32ad0e..2aaade3 100644
--- a/006_hindley_milner.md
+++ b/006_hindley_milner.md
@@ -1348,7 +1348,7 @@ The omega combinator will not pass the occurs check.
 
 ```haskell
 Poly> \x -> x x
-Cannot construct the the infinite type: a = a -> b
+Cannot construct the infinite type: a = a -> b
 ```
 
 The file ``test.ml`` provides a variety of tests of the little interpreter. For
diff --git a/008_extended_parser.md b/008_extended_parser.md
index de99c17..b237584 100644
--- a/008_extended_parser.md
+++ b/008_extended_parser.md
@@ -193,7 +193,7 @@ tokens :-
 Happy
 -----
 
-Using Happy and our previosly defind lexer we'll write down the production rules
+Using Happy and our previously defined lexer we'll write down the production rules
 for our simple untyped lambda calculus. 
 
 We start by defining a ``Syntax`` module where we define the AST we'll generate
diff --git a/chapter9/provenance/Pretty.hs b/chapter9/provenance/Pretty.hs
index 143bb24..e8ae036 100644
--- a/chapter9/provenance/Pretty.hs
+++ b/chapter9/provenance/Pretty.hs
@@ -62,7 +62,7 @@ instance Show TypeError where
     ]
   show (InfiniteType (TV a) la b) =
     concat [
-      "Cannot construct the the infinite type: "
+      "Cannot construct the infinite type: "
       , a
       , " = "
       , pptype b