diff --git a/Advanced/Lambda Calculus/main.tex b/Advanced/Lambda Calculus/main.tex index 3f834ed..3eb8c4d 100755 --- a/Advanced/Lambda Calculus/main.tex +++ b/Advanced/Lambda Calculus/main.tex @@ -1,7 +1,7 @@ % use [nosolutions] flag to hide solutions. % use [solutions] flag to show solutions. \documentclass[ - nosolutions, + solutions, singlenumbering ]{../../resources/ormc_handout} diff --git a/Advanced/Lambda Calculus/parts/00 intro.tex b/Advanced/Lambda Calculus/parts/00 intro.tex index fb8d92e..eb136b1 100755 --- a/Advanced/Lambda Calculus/parts/00 intro.tex +++ b/Advanced/Lambda Calculus/parts/00 intro.tex @@ -12,11 +12,7 @@ This tells us that $I$ is a function that takes its input, $a$, to itself. We'll To apply functions, put them next to their inputs. We'll omit the usual parentheses to save space. $$ - I ~ \star = (\lm a . a) ~ \star = \star -$$ - -$$ -(M~\star) = +(I~\star) = (\lm \tzm{b}a. a)~\tzmr{a}\star = \star \begin{tikzpicture}[ diff --git a/Advanced/Lambda Calculus/parts/02 boolean.tex b/Advanced/Lambda Calculus/parts/02 boolean.tex index 62de628..d303875 100755 --- a/Advanced/Lambda Calculus/parts/02 boolean.tex +++ b/Advanced/Lambda Calculus/parts/02 boolean.tex @@ -1,6 +1,6 @@ \section{Boolean Algebra} -The Kestrel selects its first argument, and the Kite selects its second. This \say{choosing} behavior is awfully similar to something you may have already seen... +The Kestrel selects its first argument, and the Kite selects its second. This \say{choosing} behavior is similar to something you may have already seen... \vspace{1ex} diff --git a/Advanced/Lambda Calculus/parts/03 numbers.tex b/Advanced/Lambda Calculus/parts/03 numbers.tex index 3162211..8aee0a3 100755 --- a/Advanced/Lambda Calculus/parts/03 numbers.tex +++ b/Advanced/Lambda Calculus/parts/03 numbers.tex @@ -58,7 +58,7 @@ How about $(8~NOT~F)$? \problem{} This handout may remind you of Professor Oleg's handout on Peano's axioms. Good. \\ -While you're there, recall the tools we used to build the natural numbers: \\ +Recall the tools we used to build the natural numbers: \\ We had a zero element and a \say{successor} operation so that $1 \coloneqq S(0)$, $2 \coloneqq S(1)$, and so on. \vspace{1ex} diff --git a/Advanced/Lambda Calculus/parts/05 challenges.tex b/Advanced/Lambda Calculus/parts/05 challenges.tex index 3d2d4a5..c8d9736 100755 --- a/Advanced/Lambda Calculus/parts/05 challenges.tex +++ b/Advanced/Lambda Calculus/parts/05 challenges.tex @@ -1,7 +1,6 @@ \section{Challenges} Do \ref{Yfac} first, then finish the rest in any order. \\ -Have fun! \problem{} Design a recursive factorial function using $Y$. \\