diff --git a/Advanced/Lambda Calculus/parts/00 intro.tex b/Advanced/Lambda Calculus/parts/00 intro.tex
index 97a1f3d..9ce3324 100755
--- a/Advanced/Lambda Calculus/parts/00 intro.tex	
+++ b/Advanced/Lambda Calculus/parts/00 intro.tex	
@@ -224,7 +224,7 @@ A = \lm f .(\tzm{a} ~ \lm a . f(f(a)) ~ \tzm{b})
 	\path[draw = gray] (aa) to (bb);
 \end{tikzpicture}
 $$
-When we evaluate $A$ with one input, it constructs a new function with the argument we gave it. \par
+When we evaluate $A$ with one input, it constructs a new function with the argument we give it. \par
 For example, let's apply $A$ to an arbirary function $N$:
 $$
 	A~N =
@@ -242,7 +242,7 @@ $$
 	\end{tikzpicture}
 $$
 Above, $A$ replaced every $f$ in its definition with an $N$. \par
-You can think of $A$ as a \say{factory} that constructs functions using the inputs we gave it.
+You can think of $A$ as a \say{factory} that constructs functions using the inputs we provide.
 
 \problem{}<firstcardinal>
 Let $C = \lm f. (\lm g. \lm x. (g(f(x))))$. What does $B$ do? \par