Higher-order functions: Difference between revisions
m
→{{header|Binary Lambda Calculus}}
imported>Tromp (Higher Order Functions in BLC) |
|||
Line 506:
Every BLC program uses higher order functions, since the parsed lambda term is applied to the remainder of input, which is, like everything in lambda calculus, itself a function. For example, the empty input is nil = <code>\x\y.y</code>. So the following minimal 4-bit BLC program passes nil to the identity function:
<
=={{header|BQN}}==
|