0 then true else 
even(n-1) fi (recursive)
n:
. even(n) 
b == if b
false else true fib:. b j == if i=j true ; false fii,j:
. (i=j) x(*) else y(
x.x) fiA:Type, b:, x:(b
A), y:((b)A). bif(b; bx.x(bx); by.y(by)) A| Who Cites even? | |
| even | 0 then true else even(n-1) fi (recursive) |
| n:. even(n) | |
| bnot | b == if b false else true fi |
| b:. b | |
| eq_int | j == if i=j true ; false fi |
| i,j:. (i=j) | |
| bif | x(*) else y(x.x) fi |
| A:Type, b:, x:(bA), y:((b)A). bif(b; bx.x(bx); by.y(by)) A |
About:
 |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |