=={{header|Binary Lambda Calculus}}==
<syntaxhighlight lang="python">Y = lambda a: [(lambda x: lambda: x(Y(a)))(f) for f in a]
...
12 KB (1,765 words) - 11:44, 24 May 2024
...or application, and 1^n0 for variable n (which binds to the n'th enclosing lambda).
BLC also specifies a way to represent bits and lists as lambda terms, which provides the following I/O convention:
...
33 KB (3,787 words) - 16:10, 2 March 2024
=={{header|Binary Lambda Calculus}}==
...
11 KB (1,428 words) - 16:23, 7 March 2024
* "Lambda calculus with types" H Barendregt, W Dekkers, R Statman - Handbook of logic in compu
...
4 KB (684 words) - 15:14, 13 October 2012
=={{header|Binary Lambda Calculus}}==
...riables to the divergent Omega = <code>(\x.x x)(\x.x x)</code>, the lambda calculus equivalent of an infinite loop. That makes the following 2-bit BLC program
...
23 KB (3,174 words) - 17:09, 20 April 2024
=={{header|Binary Lambda Calculus}}==
...
21 KB (2,658 words) - 14:42, 1 March 2024
=={{header|Binary Lambda Calculus}}==
...
25 KB (2,903 words) - 11:07, 1 March 2024
=={{header|Binary Lambda Calculus}}==
In lambda calculus, <code>\n. n n</code> is a function mapping a Church numeral n to the Churc
...
46 KB (5,350 words) - 14:50, 1 March 2024
(setq zero '(lambda (f x) x))
(freeze '(n) '(lambda (f x) (f (n f x)))))
...
142 KB (20,183 words) - 12:22, 5 March 2024
=={{header|Binary Lambda Calculus}}==
===LAMBDA===
...
75 KB (8,023 words) - 17:08, 16 April 2024
...t' in which a 'handler' (with some default or vanilla name like 'call' or 'lambda') is embedded. First class use of an ordinary 2nd class 'handler' function
=={{header|Binary Lambda Calculus}}==
...
80 KB (10,632 words) - 14:43, 1 March 2024
=={{header|Binary Lambda Calculus}}==
...
35 KB (4,688 words) - 14:35, 1 March 2024
=={{header|Binary Lambda Calculus}}==
...
36 KB (4,804 words) - 19:59, 22 February 2024
=={{header|Binary Lambda Calculus}}==
...
47 KB (5,823 words) - 16:01, 7 March 2024
=={{header|Binary Lambda Calculus}}==
...
47 KB (6,032 words) - 17:48, 1 March 2024
=={{header|Binary Lambda Calculus}}==
In lambda calculus, the compose functions happens to coincide with multiplication on Church nu
...
101 KB (14,223 words) - 22:04, 13 March 2024
=={{header|Binary Lambda Calculus}}==
A minimal size (right) fold in lambda calculus is <code>fold = \f\z (let go = \l.l(\h\t\z.f h (go t))z in go)</code> which
...
98 KB (13,132 words) - 14:31, 1 March 2024
===lambda 'light'===
===pure lambda calculus===
...
123 KB (16,892 words) - 07:55, 18 May 2024
...l programming]] and the [[wp:lambda calculus|lambda calculus]], functions (lambda expressions) don't have state and are only allowed to refer to arguments of
...[wp:Fibonacci number|Fibonacci numbers]] from other stateless functions or lambda expressions.
...
194 KB (25,693 words) - 12:33, 15 March 2024
=={{header|Binary Lambda Calculus}}==
...o, world!</code> follows this pattern, with the initial space encoding the lambda term <code>\x.x</code> for the identity function.
...
63 KB (8,894 words) - 16:41, 7 March 2024