Minor edits
This commit is contained in:
parent
6236cebaed
commit
d20ddd26b1
@ -1,7 +1,7 @@
|
|||||||
% use [nosolutions] flag to hide solutions.
|
% use [nosolutions] flag to hide solutions.
|
||||||
% use [solutions] flag to show solutions.
|
% use [solutions] flag to show solutions.
|
||||||
\documentclass[
|
\documentclass[
|
||||||
nosolutions,
|
solutions,
|
||||||
singlenumbering
|
singlenumbering
|
||||||
]{../../resources/ormc_handout}
|
]{../../resources/ormc_handout}
|
||||||
|
|
||||||
|
@ -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.
|
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
|
(I~\star) =
|
||||||
$$
|
|
||||||
|
|
||||||
$$
|
|
||||||
(M~\star) =
|
|
||||||
(\lm \tzm{b}a. a)~\tzmr{a}\star =
|
(\lm \tzm{b}a. a)~\tzmr{a}\star =
|
||||||
\star
|
\star
|
||||||
\begin{tikzpicture}[
|
\begin{tikzpicture}[
|
||||||
|
@ -1,6 +1,6 @@
|
|||||||
\section{Boolean Algebra}
|
\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}
|
\vspace{1ex}
|
||||||
|
|
||||||
|
@ -58,7 +58,7 @@ How about $(8~NOT~F)$?
|
|||||||
|
|
||||||
\problem{}
|
\problem{}
|
||||||
This handout may remind you of Professor Oleg's handout on Peano's axioms. Good. \\
|
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.
|
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}
|
\vspace{1ex}
|
||||||
|
@ -1,7 +1,6 @@
|
|||||||
\section{Challenges}
|
\section{Challenges}
|
||||||
|
|
||||||
Do \ref{Yfac} first, then finish the rest in any order. \\
|
Do \ref{Yfac} first, then finish the rest in any order. \\
|
||||||
Have fun!
|
|
||||||
|
|
||||||
\problem{}<Yfac>
|
\problem{}<Yfac>
|
||||||
Design a recursive factorial function using $Y$. \\
|
Design a recursive factorial function using $Y$. \\
|
||||||
|
Loading…
x
Reference in New Issue
Block a user