X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment4.mdwn;h=6a528a23c943a8f0b3a0e909f999092f657f900d;hp=2c480096145d712a9f3018d9d8c289a43c3c9664;hb=9888d5cbf679f92c7447c7d4eb06ad407e974f94;hpb=40f8c745a271a15e718e2a52a94f4ef27a152d80 diff --git a/assignment4.mdwn b/assignment4.mdwn index 2c480096..6a528a23 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -64,10 +64,14 @@ return later in the term to the problem of determining when two trees have the same fringe. For now, one straightforward way to determine this would be: enumerate the fringe of the first tree. That gives you a list. Enumerate the fringe of the second tree. That also gives you a list. Then compare the two -lists to see if they're equal. (You just programmed this above.) +lists to see if they're equal. + +Write the fringe-enumeration function. It should work on the +implementation of trees you designed in the previous step, and it +should make use of the list comparison function you wrote for question +2. Thus you'll have to make sure you only use Church numerals as the +labels of your leaves, though nothing enforces this self-discipline. -Write the fringe-enumeration function. It should work on the implementation of -trees you designed in the previous step. @@ -132,7 +136,7 @@ definitions of `even` and `odd`? 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.)