projects
/
lambda.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Merge branch 'pryor'
[lambda.git]
/
assignment4.mdwn
diff --git
a/assignment4.mdwn
b/assignment4.mdwn
index
3e3b718
..
12c1ef2
100644
(file)
--- a/
assignment4.mdwn
+++ b/
assignment4.mdwn
@@
-51,7
+51,7
@@
ordered from left to right. For example, the fringe of this tree:
/ \
1 2
/ \
1 2
-is
[1;2;3]
. And that is also the fringe of this tree:
+is
`[1;2;3]`
. And that is also the fringe of this tree:
.
/ \
.
/ \
@@
-68,15
+68,13
@@
lists to see if they're equal. (You just programmed this above.)
Write the fringe-enumeration function. It should work on the implementation of
trees you designed in the previous step.
Write the fringe-enumeration function. It should work on the implementation of
trees you designed in the previous step.
-
-(See [[hints/Assignment 4 hint 3]] if you need some hints.)
</OL>
#Mutually-recursive functions#
</OL>
#Mutually-recursive functions#
-<OL start=
4
>
+<OL start=
5
>
<LI>(Challenging.) One way to define the function `even` is to have it hand off
part of the work to another function `odd`:
<LI>(Challenging.) One way to define the function `even` is to have it hand off
part of the work to another function `odd`:
@@
-134,7
+132,7
@@
definitions of `even` and `odd`?
notes](/week3/#index4h2) as a model, construct a pair `Y1` and `Y2` that behave
in the way described.
notes](/week3/#index4h2) as a model, construct a pair `Y1` and `Y2` that behave
in the way described.
-(See [[hints/Assignment 4 hint
4
]] if you need some hints.)
+(See [[hints/Assignment 4 hint
3
]] if you need some hints.)
</OL>
</OL>