X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment4.mdwn;h=cd927873638b3ffbd724d09b599e2e1f211d5c89;hp=8b8a19dc78c1b71ec20e64e6df79d8599f245755;hb=f3e44d1a6911bf2bf8376bd3b711adf63cdeee13;hpb=2dad468862d6fff48c8f499386dc571bd899bc28
diff --git a/assignment4.mdwn b/assignment4.mdwn
index 8b8a19dc..cd927873 100644
--- a/assignment4.mdwn
+++ b/assignment4.mdwn
@@ -34,9 +34,14 @@ First, read this: [[Implementing trees]]
- Write an implementation of leaf-labeled trees. You can do something v3-like, or use the Y combinator, as you prefer.
- You'll need an operation `make_leaf` that turns a label into a new leaf. You'll need an operation `make_node` that takes two subtrees (perhaps leaves, perhaps other nodes) and joins them into a new tree. You'll need an operation `isleaf` that tells you whether a given tree is a leaf. And an operation `extract_label` that tells you what value is associated with a given leaf.
-
-
- The **fringe** of a leaf-labeled tree is the list of values at its leaves, ordered from left to right. For example, the fringe of this tree:
+You'll need an operation `make_leaf` that turns a label into a new leaf. You'll
+need an operation `make_node` that takes two subtrees (perhaps leaves, perhaps
+other nodes) and joins them into a new tree. You'll need an operation `isleaf`
+that tells you whether a given tree is a leaf. And an operation `extract_label`
+that tells you what value is associated with a given leaf.
+
+
- The **fringe** of a leaf-labeled tree is the list of values at its leaves,
+ordered from left to right. For example, the fringe of this tree:
.
/ \