2 ms·
> {[]} = \c n. n > {x::y} = \c n. c x y Note that Binary Lambda Calculus uses the simpler {x::y} = \c. c x y, which allows you to operate on a list l with
by tromp 4y ago
> {[]} = \c n. n
> {x::y} = \c n. c x y
Note that Binary Lambda Calculus uses the simpler {x::y} = \c. c x y,
which allows you to operate on a list l with
l (\head \tail \dummy. non_null_case) null_case