Search results

View ( | ) (20 | 50 | 100 | 250 | 500)
  • =={{header|Binary Lambda Calculus}}== ...
    53 KB (6,891 words) - 09:59, 9 June 2024
  • =={{header|Binary Lambda Calculus}}== {lambda {} ...
    67 KB (8,145 words) - 06:45, 8 June 2024
  • =={{header|Binary Lambda Calculus}}== ...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</cod ...
    123 KB (16,128 words) - 03:15, 17 March 2024
  • Lambda function definition: ⍝⍝ A 'dfn' or 'lambda' (anonymous function) ...
    130 KB (17,671 words) - 14:24, 13 June 2024
  • =={{header|Binary Lambda Calculus}}== corresponding to the smallest valid lambda term, the identity function \x.x ...
    65 KB (8,865 words) - 19:20, 23 May 2024
  • =={{header|Binary Lambda Calculus}}== In the lambda calculus, we can map over a list as in https://github.com/tromp/AIT/blob/master/list ...
    108 KB (14,263 words) - 11:52, 13 June 2024
  • =={{header|Binary Lambda Calculus}}== The standard representations for the booleans in lambda calculus are true = \then. \else. then, false = \then. \else. else, which correspond ...
    117 KB (17,619 words) - 15:30, 30 May 2024
  • =={{header|Binary Lambda Calculus}}== {lambda {:i :n} ...
    94 KB (12,189 words) - 17:07, 13 June 2024
  • =={{header|Binary Lambda Calculus}}== Minimal definitions of the logical operations in lambda calculus are: and = <code>\a\b.a b a</code>, or = <code>\a\b.a a b</code>, not = <co ...
    133 KB (19,131 words) - 16:59, 13 June 2024
  • rank: 764 [tied] (1 entry) Binary Lambda Calculus rank: 764 [tied] (1 entry) Lambda Prolog ...
    93 KB (6,839 words) - 10:11, 16 October 2022
  • =={{header|Binary Lambda Calculus}}== In the lambda calculus, one can return a tuple, which when applied to a function f, applies f to a ...
    108 KB (15,122 words) - 16:44, 22 February 2024
  • =={{header|Binary Lambda Calculus}}== {def left {lambda {:d :n} ...
    159 KB (16,052 words) - 13:49, 14 May 2024
  • =={{header|Binary Lambda Calculus}}== One of the best ways to document BLC programs is to generate them from a lambda file using the blc tool from https://github.com/tromp/AIT ...
    82 KB (11,737 words) - 17:12, 22 February 2024
  • "zeta", "eta", "theta", "iota", "kappa", "lambda", "mu"] property lambda : f ...
    96 KB (12,493 words) - 18:42, 14 June 2024
  • =={{header|Binary Lambda Calculus}}== In lambda calculus, the oddness of a given church numeral n can be computed as n applications ...
    125 KB (16,694 words) - 08:13, 31 May 2024
  • |Simple notation for Lambda calculus, Homoiconicity ...
    42 KB (4,729 words) - 00:04, 9 March 2024
  • |[[:Category:Binary Lambda Calculus|Binary Lambda Calculus]] |[[:Category:Lambda Prolog|Lambda Prolog]] ...
    83 KB (7,163 words) - 00:11, 2 June 2024
  • =={{header|Binary Lambda Calculus}}== ...
    92 KB (13,012 words) - 08:57, 10 June 2024
  • =={{header|Binary Lambda Calculus}}== (reduce (lambda (a b) (concatenate 'bit-vector a b)) ...
    137 KB (16,930 words) - 07:19, 12 April 2024
  • =={{header|Binary Lambda Calculus}}== ...ldin, per activation context (thats why it is enclosed into self executing lambda), var <tt>arguments</tt> for temp storage. ...
    112 KB (17,024 words) - 14:25, 13 June 2024
View ( | ) (20 | 50 | 100 | 250 | 500)