Skip to content

Fix small typo #330

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 23, 2023
Merged

Fix small typo #330

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion content/lambda-calculus/introduction/computable-lambda.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down