From 148e4f4a78cb557d69117452425b0e6d62146ccf Mon Sep 17 00:00:00 2001 From: Abrahim Ladha Date: Thu, 23 Feb 2023 00:11:05 -0500 Subject: [PATCH] Fix small typo --- content/lambda-calculus/introduction/computable-lambda.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/lambda-calculus/introduction/computable-lambda.tex b/content/lambda-calculus/introduction/computable-lambda.tex index fe139bfd..c99cdf1c 100644 --- a/content/lambda-calculus/introduction/computable-lambda.tex +++ b/content/lambda-calculus/introduction/computable-lambda.tex @@ -15,7 +15,7 @@ \end{thm} \begin{proof} -Wwe need to show that every partial computable function~$f$ is +We need to show that every partial computable function~$f$ is !!{lambda defined} by a lambda term~$F$. By Kleene's normal form theorem, it suffices to show that every primitive recursive function is !!{lambda defined} by a lambda term, and then that the functions