projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
09ae117
)
(no commit message)
author
chris
<chris@web>
Sun, 8 Mar 2015 21:30:51 +0000
(17:30 -0400)
committer
Linux User
<ikiwiki@localhost.members.linode.com>
Sun, 8 Mar 2015 21:30:51 +0000
(17:30 -0400)
topics/_week7_eval_cl.mdwn
patch
|
blob
|
history
diff --git
a/topics/_week7_eval_cl.mdwn
b/topics/_week7_eval_cl.mdwn
index
ef5a209
..
102848d
100644
(file)
--- a/
topics/_week7_eval_cl.mdwn
+++ b/
topics/_week7_eval_cl.mdwn
@@
-7,7
+7,7
@@
We've discussed evaluation order before, primarily in connection with
the untyped lambda calculus. Whenever a term contains more than one
redex, we have to choose which one to reduce, and this choice can make
We've discussed evaluation order before, primarily in connection with
the untyped lambda calculus. Whenever a term contains more than one
redex, we have to choose which one to reduce, and this choice can make
-a difference. For instance, in the term `((\x.I)(ωω)`, if we reduce
+a difference. For instance, in the term `((\x.I)(ωω)
)
`, if we reduce
the leftmost redex first, the term reduces to the normal form `I` in
one step. But if we reduce the left most redex instead (namely,
`(ωω)`), we do not arrive at a normal form, and are in danger of
the leftmost redex first, the term reduces to the normal form `I` in
one step. But if we reduce the left most redex instead (namely,
`(ωω)`), we do not arrive at a normal form, and are in danger of