X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=arithmetic.mdwn;h=bc531ecddac814bf05bd763e06c24a01b7f04d24;hp=cac56f206cb497b9acb87272a4e363a0a9c841bd;hb=0b12f248cc9c6b7361a5e3b72d3096a264eec82f;hpb=e24b3eb555211cb2d9af17355b305313ba0eaf7a

diff --git a/arithmetic.mdwn b/arithmetic.mdwn
index cac56f20..bc531ecd 100644
--- a/arithmetic.mdwn
+++ b/arithmetic.mdwn
@@ -44,7 +44,20 @@ Here are a bunch of pre-tested operations for the untyped lambda calculus. In so
 	let map = \f lst. lst (\h sofar. make_list (f h) sofar) empty  in
 	let filter = \f lst. lst (\h sofar. f h (make_list h sofar) sofar) empty  in ; or
 	let filter = \f lst. lst (\h. f h (make_list h) I) empty  in
-	
+
+	; append list2 to list1 with: list1 make_list list2
+	let singleton = \x f z. f x z  in
+	let reverse = \lst. lst (\h sofar. sofar make_list (singleton h)) empty  in
+	let zip = \left right. left (\h sofar. sofar (\x y. isempty y
+										sofar
+										(make_pair (make_list (\u v. head y (u v) h) x) (tail y))
+									)
+									(make_pair empty (map right (\h u v. u v h)))
+								)
+						(\x y. reverse x)  in
+	let all = \f lst. lst (\h sofar. and sofar (f h)) true  in
+	let any = \f lst. lst (\h sofar. or sofar (f h)) false  in
+
 
 	; version 1 lists
 
@@ -201,7 +214,7 @@ Here are a bunch of pre-tested operations for the untyped lambda calculus. In so
 	; Rosenbloom's fixed point combinator
 	let Y = \f. (\h. f (h h)) (\h. f (h h)) in
 	; Turing's fixed point combinator
-	let Z = (\u f. f (u u f)) (\u f. f (u u f))  in
+	let Theta = (\u f. f (u u f)) (\u f. f (u u f))  in
 
 
 	; length for version 1 lists
@@ -218,7 +231,7 @@ Here are a bunch of pre-tested operations for the untyped lambda calculus. In so
 
 
 
-	fact Z 3  ; returns 6
+	fact Theta 3  ; returns 6
 
 
 <!--