; a fixed-point combinator for defining recursive functions
let Y = \f. (\h. f (h h)) (\h. f (h h)) in
let length = Y (\length l. isempty l 0 (succ (length (tail l)))) in
; a fixed-point combinator for defining recursive functions
let Y = \f. (\h. f (h h)) (\h. f (h h)) in
let length = Y (\length l. isempty l 0 (succ (length (tail l)))) in