Admit it, /prog/

You fap to recursive lambdas

BAWWWWWWWWW IT'S TRUE SO RONERY~
;_;

>>1 is not a programmer and hangs out here just for fun.

I would recurse your lambda, if you know what I mean.

You cannot achieve recursion (or iteration, for that matter) with lambda calculus.

>>5
Brick shitting guaranteed

>>5
Incorrect, here is how to count to 0-5 with typed lambda (lisp)

((lambda (f n)
  (if (= n 5) n
    (f f (+ n 1))))
(lambda (f n)
  (if (= n 5) n
    (f f (+ n 1)))) 0)

λf. (λx. f (x x)) (λx. f (x x))

>>7
and in fact, every scheme code that involves at least one procedure is an example of lambda recursion/iteration.
In my example, I bound the value of the lambda expression to `f' which is local to the lambda body.
`define' bounds values globally (unless, inside another procedure body)
So it's the same. I'm a happy man

Just made a 2   digit number and   validate ccnum card   type card number   and ValidateCCNum ccard   getCardType cCard getCardNumber.

Don't change these.

Name:		Email:
Entire Thread Thread List