X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=assignment4.mdwn;h=12c1ef2a213e195cd9f88066baf9e8e53e9d5c46;hb=0a79dd27b99169648a1f03ec0b8847a1c5b822fc;hp=3e3b71841c6fa51e546c65c4c527cf798836de40;hpb=befb1d4a74380348118ed36c090f9eb1bbac1996;p=lambda.git diff --git a/assignment4.mdwn b/assignment4.mdwn index 3e3b7184..12c1ef2a 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -51,7 +51,7 @@ ordered from left to right. For example, the fringe of this tree: / \ 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. - -(See [[hints/Assignment 4 hint 3]] if you need some hints.) #Mutually-recursive functions# -