6 How would you define an operation to reverse a list? (Don't peek at the
7 [[lambda_library]]! Try to figure it out on your own.) Choose whichever
8 implementation of list you like. Even then, there are various strategies you
12 #Comparing lists for equality#
19 ; deconstruct our sofar-pair
20 sofar (\might_be_equal right_tail.
23 (and (and might_be_equal (not (isempty right_tail))) (eq? hd (head right_tail)))
27 ; we pass along the fold a pair
28 ; (might_for_all_i_know_still_be_equal?, tail_of_reversed_right)
29 ; when left is empty, the lists are equal if right is empty
34 ; when fold is finished, check sofar-pair
35 (\might_be_equal right_tail. and might_be_equal (isempty right_tail))
38 #Enumerating the fringe of a leaf-labeled tree#
40 [[Implementing trees]]