X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=hints%2Fassignment_4_hint_2.mdwn;h=f9f4cf253a0b938b2d8a877bad7d90dd7051086e;hp=78cb1bd41f1318724f9168f207868a7eb7914f84;hb=HEAD;hpb=4cea4f69242f3a229292186c8fa652942f31f8b8

diff --git a/hints/assignment_4_hint_2.mdwn b/hints/assignment_4_hint_2.mdwn
deleted file mode 100644
index 78cb1bd4..00000000
--- a/hints/assignment_4_hint_2.mdwn
+++ /dev/null
@@ -1,25 +0,0 @@
-Hints for list\_equal.
-
-<!--
-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
-                    true ; for all we know so far, they might still be equal
-                    (reverse right)
-                )
-                ; when fold is finished, check sofar-pair
-                (\might_be_equal right_tail. and might_be_equal (isempty right_tail))
--->