projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
8912132
)
Alpha-convert booleans
author
jim
<jim@web>
Fri, 20 Feb 2015 13:38:06 +0000
(08:38 -0500)
committer
Linux User
<ikiwiki@localhost.members.linode.com>
Fri, 20 Feb 2015 13:38:06 +0000
(08:38 -0500)
topics/week4_fixed_point_combinators.mdwn
patch
|
blob
|
history
diff --git
a/topics/week4_fixed_point_combinators.mdwn
b/topics/week4_fixed_point_combinators.mdwn
index
601ad81
..
b20212d
100644
(file)
--- a/
topics/week4_fixed_point_combinators.mdwn
+++ b/
topics/week4_fixed_point_combinators.mdwn
@@
-553,9
+553,9
@@
then this is a fixed-point combinator:
For those of you who like to watch ultra slow-mo movies of bullets
piercing apples, here's a stepwise computation of the application of a
recursive function. We'll use a function `sink`, which takes one
For those of you who like to watch ultra slow-mo movies of bullets
piercing apples, here's a stepwise computation of the application of a
recursive function. We'll use a function `sink`, which takes one
-argument. If the argument is boolean true (i.e., `\
x y. x
`), it
+argument. If the argument is boolean true (i.e., `\
y n. y
`), it
returns itself (a copy of `sink`); if the argument is boolean false
returns itself (a copy of `sink`); if the argument is boolean false
-(`\
x y. y
`), it returns `I`. That is, we want the following behavior:
+(`\
y n. n
`), it returns `I`. That is, we want the following behavior:
sink false <~~> I
sink true false <~~> I
sink false <~~> I
sink true false <~~> I