projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
ff25bb9
)
(no commit message)
author
barker
<barker@web>
Mon, 20 Sep 2010 03:49:39 +0000
(23:49 -0400)
committer
Lambda Wiki
<lambda@SERVER.PHILOSOPHY.FAS.NYU.EDU>
Mon, 20 Sep 2010 03:49:39 +0000
(23:49 -0400)
assignment2.mdwn
patch
|
blob
|
history
diff --git
a/assignment2.mdwn
b/assignment2.mdwn
index
6babbc8
..
96ac3bb
100644
(file)
--- a/
assignment2.mdwn
+++ b/
assignment2.mdwn
@@
-72,13
+72,13
@@
For these exercises, assume that `LIST` is the result of evaluating:
(make-list a (make-list b (make-list c (make-list d (make-list e empty)))))
(make-list a (make-list b (make-list c (make-list d (make-list e empty)))))
-
16.
What would be the result of evaluating:
+
(16).
What would be the result of evaluating:
LIST make-list empty
[[Assignment 2 hint 1]]
LIST make-list empty
[[Assignment 2 hint 1]]
-
17.
Based on your answer to question 1, how might you implement the **map** function? Expected behavior:
+
(17).
Based on your answer to question 1, how might you implement the **map** function? Expected behavior:
<pre><code>map f LIST <~~> (make-list (f a) (make-list (f b) (make-list (f c) (make-list (f d) (make-list (f e) empty)))))</code></pre>
<pre><code>map f LIST <~~> (make-list (f a) (make-list (f b) (make-list (f c) (make-list (f d) (make-list (f e) empty)))))</code></pre>