Mark/handouts
Mark/handouts
1
0
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

Typos

Browse Source
This commit is contained in:
Mark 2023-10-17 09:19:14 -07:00
parent a7dfe2728a
commit 5ddd354b4a
Signed by: Mark
GPG Key ID: AD62BB059C2AAEE4
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Advanced/Lambda Calculus/parts/00 intro.tex
View File

@ -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