X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment4.mdwn;h=9b7ec2c028622dc92e17dced54403aa6043b8896;hp=34fb044d6197fd875e56a4f15ecc26bc2a233e37;hb=HEAD;hpb=0a6cb8dd4a9460b13006f75f6a5b84d434aba212

diff --git a/assignment4.mdwn b/assignment4.mdwn
deleted file mode 100644
index 34fb044d..00000000
--- a/assignment4.mdwn
+++ /dev/null
@@ -1,43 +0,0 @@
-Assignment 4
-------------
-
-#Reversing a list#
-
-How would you define an operation to reverse a list? (Don't peek at the
-[[lambda_library]]! Try to figure it out on your own.) Choose whichever
-implementation of list you like. Even then, there are various strategies you
-can use.
-
-
-#Comparing lists for equality#
-
-<!--
-let list_equal =
-    \left right. left
-                ; here's our f
-                (\hd sofar.
-                    ; deconstruct our sofar-pair
-                    sofar (\might_be_equal right_tail.
-                        ; our new sofar
-                        make_pair
-                        (and (and might_be_equal (not (isempty right_tail))) (eq? hd (head right_tail)))
-                        (tail right_tail)
-                    ))
-                ; here's our z
-                ; we pass along the fold a pair
-                ; (might_for_all_i_know_still_be_equal?, tail_of_reversed_right)
-                ; when left is empty, the lists are equal if right is empty
-                (make_pair
-                    (not (isempty right))
-                    (reverse right)
-                )
-                ; when fold is finished, check sofar-pair
-                (\might_be_equal right_tail. and might_be_equal (isempty right_tail))
--->
-
-#Enumerating the fringe of a leaf-labeled tree#
-
-[[Implementing trees]]
-
-
-