Higher-order functions: Difference between revisions
Content added Content deleted
m (→{{header|Wren}}: Changed to Wren S/H) |
imported>Tromp (Higher Order Functions in BLC) |
||
Line 502: | Line 502: | ||
441 |
441 |
||
</pre> |
</pre> |
||
=={{header|Binary Lambda Calculus}}== |
|||
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: |
|||
<syntaxhighlight>0010</syntaxhighlight> |
|||
=={{header|BQN}}== |
=={{header|BQN}}== |