With If/else:
(Lambda x, y:x if x < y else y) (1, 2)
The branch of the house:
(Lambda x: (Lambda y: (lambda z:x + y + z ) (1)) (2)) (3)
Recursion:
Func = Lambda N:1 if n = = 0 Else n * func (N-1) func (5) F = lambda func, n:1 if n = = 0 Else n * Func (func, n-1) pr int f (f, 4)
Build Chow Kit Encoding:
true = lambda X:lambda y:xfalse = lambda X:lambda y:yif_then_else = lambda A:lambda b:lambda c: (a) (b) (c) Zero = Lambda F:lambda x:xsucc = (lambda n:lambda f:lambda x:f (n (f) (x))) one = SUCC (zero) Plus_one = LAMBD A x:x + 1add = (lambda m:lambda n:lambda F:lambda x:n (f) (M (f) (x))) mult = (Lambda m:lambda n:lambd A F:lambda x:n (M (f)) (x)) exp = lambda M:lambda N/A (m) church_numeral = Lambda-N (plus_one) (0) Natu Ral_number_to_church = lambda Num:zero if num = = 0 Else succ (natural_number_to_church (Num- 1)) Execute = lambda s:s + ' = ' + str (eval (s)) print execute (' church_numeral (zero) ') print execute (' Church_numer Al (Succ (zero)) ') Print execute (' church_numeral (Add (one) (SUCC (one)) ') Print execute (' Church_numeral (mult (s UCC (one) (SUCC (one)) ') Print execute (' Church_numeral (exp (SUCC (SUCC (one)) (SUCC (one)) ') C200 = Natura L_number_to_church (200) c222 = Natural_number_to_church (222) Print execute (' church_numeral (Add (c200) (c222)) ') Print execute (' Church_nume RAL (If_then_else (True) (zero) (one) ') Print execute (' Church_numeral (If_then_else (False) (zero) (one) ')
Alternative use of lambda in Python