-
Notifications
You must be signed in to change notification settings - Fork 164
/
lambda.html
754 lines (576 loc) · 24.6 KB
/
lambda.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta charset="UTF-8">
<link rel="stylesheet" type="text/css" href="css/codemirror.css" />
<link rel="stylesheet" type="text/css" href="css/isicp.css" />
<script src="js/jquery.min.js"></script>
<script src="js/codemirror/lib/codemirror.js"></script>
<script src="js/codemirror/mode/scheme/scheme.js"></script>
<script type="text/javascript" src="http://labs.orezdnu.org/lambda/compatibility.js"></script>
<script type="text/javascript" src="http://labs.orezdnu.org/lambda/ui.js"></script>
<script type="text/javascript" src="http://labs.orezdnu.org/lambda/pp.js"></script>
<script type="text/javascript" src="http://labs.orezdnu.org/lambda/lambda.js"></script>
<script type="text/javascript" src="js/app.js"></script>
<link rel="stylesheet" type="text/css" href="css/default.css" />
<link rel="stylesheet" type="text/css" href="css/lambda.css" />
<style>
li {
color: inherit;
}
</style>
<script src="js/jquery.min.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$']]}
});
</script>
<script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
<script src="js/coding.js"></script>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-36868476-1']);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
</script>
</head>
<body style="width:66%; margin:0 auto">
<script>
$(function() {
init('console');
});
</script>
<p>
<h1 style="margin-bottom:0; text-align:center">From Church Numerals to Y Combinators</h1>
<h2 style="margin-top:0; text-align:center">An Interactive Tour of the Lambda Calculus</h2>
<br><br>
<h2> Introduction: How to Write Functions </h2>
<p> We'll begin our introduction to the lambda calculus by considering the question of how we might write down a function. There are standard ways to notate numbers,
$$
\def\.{\kern0pt{.}}
42 \\
0x2a
$$
<p> sets,
$$
\{0,1,2\} \\
\{x | x > 0, x \in R\}
$$
<div class="lambda">
</div>
<p> etc, but there doesn't seem to be a way to write down functions. How should we write down a function, for example, that takes a number and triples it?
<p> "Easy!" you say. "Just call that function $f$ and write
$$
f(x) = 3x
$$
<p>
<p> to define it."
<p> Well, this approach suffers the drawback that you must give the function a name. I want a way to write down anonymous functions - functions that do not have a name. I want to be able to say
$$
f = something
$$
<p> This is indispensible in writing higher-order functions, which are functions that return other functions. In the lambda calculus, we would write $f$ as
$$
\lambda x.3x
$$
<p> Where, in general, a function that takes an argument and returns something is written as
$$
\lambda [argument]\.[return\ value]
$$
<p> By the way, function application will be denoted simply by writing the function next to its operand, like so
$$
fx
$$
<p> Instead of using parentheses as in $f(x)$ because, as you will see later, there are more important things for parentheses to do.
<h2> Simple Beginnings </h2>
<p> Let's now create a universe for our functions to live in. Mathematically inclined readers might now point out that this universe must be incomplete - after all, functions must act on something, so surely we must include something else in the universe for them to act on, for example integers.
<p> To get around this, we shall let functions act on other functions; our functions shall accept other functions as arguments and returns functions. This way, our universe will only contain functions. It might seem at first that there aren't any interesting functions to write down, but let's see how far we can get. First, a function that does absolutely nothing, the <b>identity function</b>:
$$
I = \lambda t\.t
$$
<p> "You got lucky," I hear you say. "Your universe can only contain silly functions like these - I don't think you can come up with many more." Well, how about this?
$$
C_I = \lambda s\.(\lambda t\.t)
$$
<p> No matter what you pass to it, this function $C_I$ will always return the identity function. Here we see clearly why lambda notation is superior; without it, we would have to do this to define $C_I$
$$
C_I s = I \text{ for all }s\\
\text{where }It = t \text{ for all t}
$$
<p> I hope you got the hint that $C_I$ is so named because it is the <b>constant function of I</b>; we can generalise to a whole class of <b>constant functions of r</b>
$$
C_r = \lambda s\.r
$$
<p> heck, let's create a function that creates these $C_r$'s
$$
K = \lambda r\.(\lambda s\.r)
$$
<p> with the property that $Kr = C_r$. The rabbit hole goes deeper and deeper.
<div class="toggle-link" id="beginnings-toggle">
<br>
<hr>
</div>
<div class="code-container" id="beginnings-container">
<pre>
<code id="beginnings">var I = function(t){ return t };
var C_I = function(s,t) { return t };
var C_r = function(s) {return r};
var K = function(r,s){ return r };</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
Using the interpreter, confirm that <tt>K I</tt> is equivalent to <tt>C_I</tt>
</li>
<li>
Write down the function $C_{C_I}$, the constant function of $C_I$
</li>
<li>
Without using the interpreter, evaluate <tt>(K K) (K K)</tt>.
</li>
</ol>
</div>
<a style="display:none" id="run-beginnings" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('beginnings');
});
$("#beginnings-toggle").click(function(){
$("#beginnings-container").slideToggle();
})
</script>
<h2> Multiple Arguments </h2>
<p> So far, all our functions have only accepted one argument - what happens if we want them to take two or more arguments? For example, think of the two-argument function $\zeta$ that applies its second argument to the first argument.
$$
\zeta(x,y) = yx
$$
<p> The way to write this is to make the function take only the first argument $x$ and return a partially evaluated function, which then takes the second argument and processes that, then returns the final result.
$$
\zeta = \lambda x\.(\lambda y\.yx)
$$
<p> As you can see, when we feed $\zeta$ the first argument...
$$
\zeta x = \lambda y\.yx
$$
we get a <b>partially applied</b> function. When we feed that the second argument...
$$
(\zeta x)y = yx
$$
<p> We get back the finished computation. This strategy is called <b>currying</b> and should be familiar to Haskell and ML programmers, among others.
<h2> A Note on Notation </h2>
<p> You can see why we reserved brackets earlier on; without them, an expression like $KII$ is ambiguous because it could be read as either $(KI)I$ or $K(II)$.
\begin{align}
(KI)I &=C_I I \\
&= I \\
&= \lambda t\.t \\
K(II) &= KI \\
&= \lambda r\.I \\
&= \lambda r\.(\lambda t\.t) \\
\end{align}
<p> Since the first one is much more common, we will often drop the brackets. Hence our convention is that when omitted, function application starts from the leftmost pair; $KII$ is read as $(KI)I$.
<p> In a similar vein, let's adopt a convention and simplify this
$$
\zeta = \lambda x\.(\lambda y\.yx)
$$
<p> to this
$$
\zeta = \lambda xy\.yx
$$
<p> and say that multiple arguments appear between a $\lambda$ and a dot represent a curried function. Let's have a few more examples to make it clear. We'll introduce the <b>projection operators</b> $\pi_1$ and $\pi_2$, which are functions of two arguments that return either the first or the second argument.
$$
\pi_1 = \lambda xy\.x \\
\pi_2 = \lambda xy\.y
$$
<p> Notice how clearly we can see the definition now. Also notice that $\pi_1 = K$ and $\pi_2 = KI$.
<div class="toggle-link" id="multiple-arguments-notation-toggle">
<br>
<hr>
</div>
<div class="code-container" id="multiple-arguments-notation-container">
<pre>
<code id="multiple-arguments-notation">var zeta = function(x,y){ return y(x) };
var pi_1 = function(x,y){return x};
var pi_2 = function(x,y){return y};</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
Without using the interpreter, evaluate <tt>zeta pi_1 pi_2 zeta</tt>.
</li>
<li>
Let $\pi_{m/n}$ be the <b>$m^{th}$ projection operator on $n$ variables</b>; in other words, it takes $n$ arguments and returns the $m^{th}$ one. For instance, $\pi_{2/5} = \lambda abcde\. b$. Express $\pi_{3/3}$ in terms of $K$ and $I$.
</li>
<li>
In general, what must $m$ and $n$ satisfy so that $\pi_{m/n}$ is expressible in terms of $K$ and $I$?
</li>
</ol>
</div>
<a style="display:none" id="run-multiple-arguments-notation" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('multiple-arguments-notation');
});
$("#multiple-arguments-notation-toggle").click(function(){
$("#multiple-arguments-notation-container").slideToggle();
})
</script>
<h2> Interactive? </h2>
<p> I promised in the subtitle that this would be an interactive tour. Click on the thin grey line above for the interactive part. Inside you will find the console to an interpreter as well as some pre-defined terms. Note that the interpreter considers <tt>KI</tt> to be one identifier and <tt>K I</tt> to be $K$ applied to $I$. Use <tt>\</tt> to type $\lambda$.
<p> By the way, there's another expandble section after the section Simple Beginnings. I suggest that you start with that one first.
<h2> One, Two, Three... </h2>
<p> There are many ways to represent numbers via functions, to say that this function represents one, that one represents two, etc. As an exercise, try thinking of one of them.
<p> We'll focus on a classic encoding devised by Alonzo Church. The Church encoding of a number $n$ is a function that maps functions to their $n$-fold compositions.
\begin{align}
nf &= f^n \\
&= f \circ f \circ \ldots \circ f
\end{align}
<p> To use an example from trigonometry,
\begin{align}
3 \sin &= \sin \circ \sin \circ \sin \\
(3 \sin) x &= sin(sin(sin(x)))
\end{align}
<p> To derive the explicit form for $n$, we first write $f^n$ explicitly as $\lambda x\. f(f(f\ldots f(x)\ldots))$.
\begin{align}
nf &= f^n \\
&= \lambda x \.f^n x \\
&= \lambda x \.f(f(f\ldots f(x)\ldots))
\end{align}
<p> abstracting out the $f$,
$$
n = \lambda fx \.f(f(f\ldots f(x)\ldots))
$$
<p> and here are some examples to illustrate.
\begin{align}
0 &= \lambda fx\.x \\
1 &= \lambda fx\.fx \\
2 &= \lambda fx\.f(fx) \\
3 &= \lambda fx\.f(f(fx))
\end{align}
<p> Let's derive the successor function that adds one to a number.
\begin{align}
Sn &= \lambda fx\.f^{(n+1)}x \\
&= \lambda fx\.f(f^nx) \\
&= \lambda fx\.f(nfx)
\end{align}
<p> Hence,
$$
S = \lambda nfx\.f(nfx)
$$
<p> This relies on the fact that $f \circ f^n = f^{n+1}$. Using the general form $f^m \circ f^n = f^{m+n}$, we get a function $\Sigma$ that sums two numbers.
$$
\Sigma = \lambda mnfx.mf(nfx)
$$
<p> Let's do another derivation for practice – the operator $\Pi$ multiplies two numbers. We'll use the property $(f^m)^n = f^{mn}$
\begin{align}
\Pi mn &= \lambda f\.f^{mn} \\
&= \lambda f\.(f^n)^m \\
&= \lambda f\.m(f^n) \\
&= \lambda f\.m(nf) \\
\Pi &= \lambda mnf\.m(nf)
\end{align}
<div class="toggle-link" id="one-two-three-toggle">
<br>
<hr>
</div>
<div class="code-container" id="one-two-three-container">
<pre>
<code id="one-two-three">var _0 = function(s,z){ return z };
var _1 = function(s,z){ return s(z) };
var _2 = function(s,z){ return s(s(z)) };
var _3 = function(s,z){ return s(s(s(z))) };
var successor = function(m,n,f,x) {return m(f)(n(f)(x))};
var add = function(m,n,f,x){ return m(f)(n(f)(x)) };
var multiply = function(m,n,f) { return m(n(f)) };
</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
Try defining the exponentiation operator; test it by ensuring that <tt>exp _3 _2 = _9</tt>. Hint: The operator is only 6 symbols long!
</li>
<li>
Assume we have an operator <tt>pred</tt> such that <tt>pred _0 = _0</tt> and <tt>pred _n = _(n-1)</tt>. Give a short implementation of subtraction using <tt>pred</tt>. Challenge: Implement <tt>pred</tt>.
</li>
<li>
In Peano arithmetic, a natural number is defined inductively as either zero or a successor to a natural number. Is this related to our Church encoding?
</li>
<li>
Another way to embed natural numbers might be to represent $n$ as the $n$-deep constant function of $I$; for instance, $3$ would be represented by <tt>K (K (K I))</tt>. Derive arithmetic operators that work on this representation.
</li>
<li>
Is it possible to find an encoding for all integers? Rational numbers? Reals?
</li>
</ol>
</div>
<a style="display:none" id="run-one-two-three" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('one-two-three');
});
$("#one-two-three-toggle").click(function(){
$("#one-two-three-container").slideToggle();
})
</script>
<h2> Data Structures </h2>
<p> Linked Lists, Stacks, Queues, Heaps, B-Trees – our universe is still missing such data structures or even a way to express them. Let's implement one of the building blocks of data structures, the <b>pair</b>. A pair is exactly what the name suggests it is – a container containing two elements in order, the <b>head</b> and the <b>tail</b>. Programmers using lisp-descended languages will know of them as <b>cons cells</b>.
<p> Let's be more formal - we want a function $P$ that constructs a pair. Once the pair is constructed, functions $H$ and $T$ may be used to access the elements of the pair. Consistency requires that
$$
H(Pxy) = x \\
T(Pxy) = y
$$
<p> Here's a clever way of implementing $P$:
$$
Pxy = \lambda t\.txy \\
$$
<p> This now allows us to pass in a function $t$ and returns $txy$. We are almost done; to get $x$, for example, we can just pass in $\pi_1$, the first projection operator
\begin{align}
(\lambda t\.txy)\pi_1 = \pi_1 xy = x
\end{align}
<p> Written out fully,
\begin{align}
P &= \lambda xyt\.txy \\
H &= \lambda p. p(\lambda xy\.x) \\
T &= \lambda p. p(\lambda xy\.y)
\end{align}
<div class="toggle-link" id="data-structures-toggle">
<br>
<hr>
</div>
<div class="code-container" id="data-structures-container">
<pre>
<code id="data-structures">var pair = function(P,Q,x){ return x(P)(Q) };
var fst = function(p){ return p(function(x,y){ return x }) };
var snd = function(p){ return p(function(x,y){ return y }) };
var p1 = pair(pair(a)(b))(pair(c)(d));</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
Verify that <tt>fst (fst p1) = a</tt>
</li>
<li>
Scheme and Lisp programmers have conventionally represented lists as left-leaning pairs; for example, <tt>(5 (3 (42 (4 'nil))))</tt> represents the list <tt>[5, 3, 42, 4]</tt>, and where <tt>'nil</tt> is a special symbol. Let $\rho_n$ return the $n^{th}$ element of the list; for instance, $\rho_2 [5, 3, 42, 4] = 42$. Write a function that takes a number $n$ and returns $\rho_n$.
</li>
<li>
Another, more mathematically elegant, encoding represents a list as an accessor function; the list $[a, b, c]$ would be a function $f$ such that $f(0) = a$, $f(1) = b$ and $f(2) = c$. Write down the list of all even natural numbers $[0,2,4,6,\ldots$.
</li>
<li>
Yet another representation would represent $ [x, y, z]$ as $\lambda cn\.cx(cy(czn))$. What is <tt>[_5, _3, _42, _4] add _0</tt>, where <tt>add</tt> is the operator that adds Church numbers? Write the function <tt>cons</tt> that appends a number to the head of the list.
</li>
<li>
The Church encoding of $n$ requires $O(n)$ symbols to write down. Paul Graham would encode $n$ as a list of elements that has length $n$, which still requires $O(n)$ symbols. Find a way to represent $n$ using only $O(\log n)$ symbols.
</li>
</ol>
</div>
<a style="display:none" id="run-data-structures" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('data-structures');
});
$("#data-structures-toggle").click(function(){
$("#data-structures-container").slideToggle();
})
</script>
<h2> Booleans and Control Flow </h2>
<p> There are many ways to embed booleans into the lambda calculus. We could even declare that the Church numeral $1$ represents $\text{True}$ and $0$ represents $\text{False}$. However, since booleans are normally used for control flow or corditional evaluation ("if statements"), we'll choose a representation that is most convenient for expressing such control flow. Hence if $b$ is a boolean we declare it to have the property that.
$$
bxy
$$
<p> evaluates to $x$ if b is true and $y$ otherwise. Then
\begin{align}
T &= \lambda ab.a \\
F &= \lambda ab.b
\end{align}
<p> We can also define the common logical manipulators
\begin{align}
NOT &= \lambda pab. pba\\
AND &= \lambda pq. pqF \\
OR &= \lambda pq. pTq
\end{align}
<p> for example <tt>(OR p q) = (p T q)</tt> which can be read as "T if p else q", which is a correct definition of $OR$.
<p> Let's try writing a conditional expression that operates on Church numerals and tells us if its argument is zero. The trick is to make use of the fact that
$$
C_r \circ C_r = C_r
$$
<p> that is, constant functions don't change when they are composed with themselves. Similarly $C_r \circ C_r \circ C_r$ is still $C_r$, and so on. Hence, the expression
$$
n C_F
$$
<p> will evaluate to $C_F$ when $n > 0$. However, it will evaluate to $I$ when $n=0$; a zero-fold composition is the special case! Then, we simply need to pass $T$ to it
$$
Zn = n(\lambda x\. F) T
$$
<p> and we will get $T$ if $n=0$ and $F$ otherwise. Written out fully,
$$
Z = \lambda n\. n(\lambda xab\. b) (\lambda ab\. b)
$$
<div class="toggle-link" id="booleans-toggle">
<br>
<hr>
</div>
<div class="code-container" id="booleans-container">
<pre>
<code id="booleans">var T = function(x,y){ return x };
var F = function(x,y){ return y };
var not = function(p,a,b){return p(b)(a)};
var and = function(p,q){return p(q)(function(x,y){return y})};
var or = function(p,q){return p( function(x,y){ return x } )(q) };</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
We can very elegantly represent sets by their membership function, ie, $S$ is represented by $\lambda x\.[x \in S]$, where $[x \in S]$ is $T$ if $x \in S$ and $F$ otherwise. Give a definition of the empty set.
</li>
<li>
Implement set union, intersection and complement. Hint: Why have we not put this question in the section about data structures?
</li>
<li>
Is $\lambda x\.T$ a representation of a set?
</li>
<li>
Alyssa P. Hacker immediately notices that she can encode integers as a pair $(s, n)$ where $s$ is a boolean representing whether the number is signed, and $n$ a natural number. However, she runs into problems when tryin to implement multiplication. Ben Bitdiddle suggests a beter way: let the pair $(n,k)$ represent $n-k$. Why is this better?
</li>
</ol>
</div>
<a style="display:none" id="run-booleans" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('booleans');
});
$("#booleans-toggle").click(function(){
$("#booleans-container").slideToggle();
})
</script>
<h2> Recursion? </h2>
<p> Let's try to define a <b>factorial function</b> that computen $n! = n(n-1)(n-2)...2\cdot 1$
<pre>
fac =
(lambda (n)
(if (= n 0)
1
(* n (fac (- n 1)))))
</pre>
<p> There's a problem with this - lambda calculus does not allow recursive definitions. Remember, we want to define <tt>fac</tt> as an anonymous function, that is, <b>without referring to <tt>fac</tt></b>.
<p> Hence, the expression <tt>fac</tt> is not allowed within the definition. Let's replace it with something legal.
<pre>
F =
(lambda (former-fac)
(lambda (n)
(if (= n 0)
1
(* n (former-fac (- n 1))))))
</pre>
<p> you will notice that we have simply replaced <tt>fac</tt> by <tt>former-fac</tt> in the body and enclosed the whole thing in a <tt>(lambda (former-fac) .. )</tt>. We call the new function <tt>F</tt>
<p> Let's imagine we already have a working copy of <tt>fac</tt>, perhaps from Plato's heaven. What is <tt>(F fac)</tt>? it is a function of one variable,
<pre>
(F fac) =
(lambda (n)
(if (= n 0)
1
(* n (fac (- n 1)))))
</pre>
<p> We see that <tt>(F fac) = fac</tt>; this means that <tt>fac</tt> is the <b>fixed point of <tt>F</tt></b>. We are very close now, because <tt>F</tt> was defined without recursion. Now all we need is a function that finds the fixed point of its argument, a function $Y$ satisfying
$$
F(YF) = YF
$$
<p> The above equation expresses the fact that $YF$ is a fixed point of $F$. How can we define $Y$?
<h2> Y Combinator </h2>
<p> The solution to this is one of the most beautiful results of the Lambda Calculus. First, we must take a little detour.
<p> Consider
\begin{align}
\omega = (\lambda x\. xx) (\lambda x\. xx)
\end{align}
<p> Realize that $\omega$ expands to itself, that is, substitutin the second term, $\lambda x\. xx$, into the $x$ of the first term simply makes the whole expression evaluate to $\omega$ again. With a small modification,
\begin{align}
\omega' &= (\lambda x\. F(xx)) (\lambda x\. F(xx)) \\
&= F (\lambda x\. F(xx)) (\lambda x\. F(xx)) \\
&= F(\omega')
\end{align}
<p> so $\omega'$ is a fixed point of $F$. Abstracting the $F$ out, we conclude that this is the <b>Y Combinator</b>.
\begin{align}
Y = \lambda F.(\lambda x. F(xx)) (\lambda x. F(xx))
\end{align}
<div class="toggle-link" id="recursion-toggle">
<br>
<hr>
</div>
<div class="code-container" id="recursion-container">
<pre>
<code id="recursion">var Y = function(f){ return (function(x){ return f((x)(x)) })(function(x){ return f((x)(x)) }) };
var _0 = function(s,z){ return z };
var _1 = function(s,z){ return s(z) };
var _2 = function(s,z){ return s(s(z)) };
var _3 = function(s,z){ return s(s(s(z))) };
var t = function(x,y){ return x }; // true
var f = function(x,y){ return y }; // false
var if0 = function(n){ return n(function(x){ return f })(t) }; // if n equals to _0
var mul = function(m,n,s,z){ return n(m(s))(z) };
var pred = function(n,s,z){ return n(function(f,g){ return g(f(s)) })(function(x){ return z })(function(x){ return x }) };
var F = function(r,n){ return if0(n)(_1)(mul(n)(r(pred(n)))) };
var fact = Y(F);</code>
</pre>
<h3>Exercises</h3>
<ol>
<li>
What do you think $Y_k$ is? Explain why it is what you say it.
\begin{align}
Y_k &= (L L L L L L L L L L L L L L L L L L L L L L L L L L) \\
L &= \lambda abcdefghijklmnopqstuvwxyzr\.(r(thisisafixedpointcombinator))
\end{align}
<p> Note: each letter $a$, $b$, $c$ etc correspond to a single variable.
</li>
</ol>
</div>
<a style="display:none" id="run-recursion" href=".">run</a>
<script>
$(function(){
LambdaJS.App.StaticCode.run('recursion');
});
$("#recursion-toggle").click(function(){
$("#recursion-container").slideToggle();
})
</script>
<h2> More </h2>
<p> If you enjoyed this, you may enjoy my work-in-progress <a href="index.html">Interactive Structure and Interpretation of Computer Programs</a>. To get stay updated on future interactive guides, please enter your email below.
<p>
<script type="text/javascript" src="http://form.jotform.me/jsform/32423695765463"></script>
<h2> Acknowledgement </h2>
<ol>
<li>
The lambda calculus interpreter and terminal emulator used belongs to <a href="https://github.com/tarao">INA Lintaro</a> and is available on <a href="http://github.com/tarao/LambdaJS">github</a>. The expandable section below allows you to set the options for the interpreter.
</li>
<li>
Alyssa P. Hacker and Ben Bitdiddle come from the pages of the wonderful book <a href="http://mitpress.mit.edu/sicp/">Structure and Interpretation of Computer Programs</a>.
</li>
</ol>
<div class="toggle-link" id="console-options-toggle">
<br>
<hr>
</div>
<div class="code-container" id="console-options-container">
<div id="console" class="console"></div>
<ul id="strategy" class="select">
<li class="label">Evaluation strategy:</li>
</ul>
<ul id="pp" class="select">
<li class="label">Output:</li>
</ul>
<form action="." id="store"><div>
<input type="text" name="strategy" id="input-strategy" />
<input type="text" name="pp" id="input-pp" />
<input type="text" name="wait" id="input-wait" />
</div></form>
</div>
<script>
$("#console-options-toggle").click(function(){
$("#console-options-container").slideToggle();
})
</script>
<br><br><br><br>
<a href="https://github.com/zodiac/xuanji.appspot.com" target="_blank"><img style="position: absolute; top: 0; right: 0; border: 0;" src="https://s3.amazonaws.com/github/ribbons/forkme_right_green_007200.png" alt="Fork me on GitHub"></a>
</body>
</html>