diff --git a/tspl/Assignment3.lagda b/tspl/Assignment3.lagda
index 754467d6..c1bcf38d 100644
--- a/tspl/Assignment3.lagda
+++ b/tspl/Assignment3.lagda
@@ -99,7 +99,7 @@ data Tree (A B : Set) : Set where
   leaf : A → Tree A B
   node : Tree A B → B → Tree A B → Tree A B
 \end{code}
-Define a suitabve map operator over trees.
+Define a suitable map operator over trees.
 \begin{code}
 postulate
   map-Tree : ∀ {A B C D : Set}
@@ -144,7 +144,7 @@ postulate
 
 #### Exercise `map-is-fold-Tree`
 
-Demonstrate an anologue of `map-is-foldr` for the type of trees.
+Demonstrate an analogue of `map-is-foldr` for the type of trees.
 
 #### Exercise `sum-downFrom` (stretch)