From 20b0bf3e7d92849a6f1377ddb62744cb60053d5f Mon Sep 17 00:00:00 2001 From: Mark Date: Sun, 22 Oct 2023 20:55:21 -0700 Subject: [PATCH] Minor fix --- Advanced/Lambda Calculus/parts/00 intro.tex | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/Advanced/Lambda Calculus/parts/00 intro.tex b/Advanced/Lambda Calculus/parts/00 intro.tex index 101a96e..4c7c00f 100755 --- a/Advanced/Lambda Calculus/parts/00 intro.tex +++ b/Advanced/Lambda Calculus/parts/00 intro.tex @@ -321,10 +321,11 @@ We've already seen this on the previous page: $K$ takes an input $x$ and uses it You can think of $K$ as a \say{factory} that constructs functions using the input we provide. \problem{} +\vspace{1mm} % Slight gap for big paren Let $C = \lm f. \Bigl[\lm g. \Bigl( \lm x. [~ f(g(x)) ~] \Bigr)\Bigr]$. For now, we'll call it the \say{composer.} \par \note[Note]{We could also call $C$ the \say{right-associator.} Why?} -\vspace{1mm} +\vspace{3mm} $C$ has three \say{layers} of curry: it makes a function ($\lm g$) that makes another function ($\lm x$). \par If we look closely, we'll find that $C$ pretends to take three arguments.