diff --git a/doc/monads/intro.md b/doc/monads/intro.md
index 63e3a6b62a..724cbc9989 100644
--- a/doc/monads/intro.md
+++ b/doc/monads/intro.md
@@ -5,7 +5,7 @@ of [Category Theory](https://en.wikipedia.org/wiki/Monad_%28category_theory%29).
 
 Monads in Lean are so similar to Haskell that this introduction to monads is heavily based on the
 similar chapter of the [Monday Morning Haskell](https://mmhaskell.com/monads/). Many thanks to
-the authors of that material for allowing it to reused it here.
+the authors of that material for allowing us to reuse it here.
 
 Monads build on the following fundamental type classes which you will need to understand
 first before fully understanding monads. Shown in light blue are some concrete functors
@@ -60,4 +60,4 @@ This section examines what makes a monad a legal monad. You could just implement
 classes any way you want and write "monad" instances, but starting back with functors and
 applicative functors, you'll learn that all these structures have "laws" that they are expected to
 obey with respect to their behavior. You can make instances that don't follow these laws. But you do
-so at your peril, as other programmers will be very confused when they try to use them.
\ No newline at end of file
+so at your peril, as other programmers will be very confused when they try to use them.