X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=lambda_library.mdwn;h=ff363756f904d823546611348260f5caf4cd79c5;hp=f0b4f44157193f09f2620d32ca556ba649cd0dfc;hb=aa056fb83840d1a281992dc6e7db351cc513e681;hpb=273f2590356318a9d496b49b48af330711382a3c;ds=sidebyside

diff --git a/lambda_library.mdwn b/lambda_library.mdwn
index f0b4f441..ff363756 100644
--- a/lambda_library.mdwn
+++ b/lambda_library.mdwn
@@ -296,3 +296,28 @@ and all sorts of other places. Others of them are our own handiwork.
 
 
 -->
+
+<!--
+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))
+-->
+