the lambda

We can define a successor function, which takes a number n and returns n + 1 by adding an additional application of f:

    SUCC := λn.λf.λx.f (n f x)

Because the m-th composition of f composed with the n-th composition of f gives the m+n-th composition of f, addition can be defined as follows:

    PLUS := λm.λn.λf.λx.m f (n f x)

PLUS can be thought of as a function taking two natural numbers as arguments and returning a natural number; it can be verified that

    PLUS 2 3

and

    5

are equivalent lambda expressions. Since adding m to a number n can be accomplished by adding 1 m times, an equivalent definition is:

    PLUS := λm.λn.m SUCC n

>>34
http://www.google.com/search?q=how+to+geet+to+sesame+street

>>40 are you a phed or something?

>>42
No.

Look, faggot, is it that hard to answer the questions? I'm answering yours.

coined. phed. noun.
An old man pretending to be a child, and hanging around children, in the hopes of catching other old men pretending to be a child, and hanging around children..

No, im 26.

Why are you concerned with me, this is a thread discussing lambda calculus..?

>>44
Good fucking god, you finally answered. But you should act more mature, you're not 13 anymore.

I'm concerned about you because you abuse ellipsis and emoticons, and shitpost to the point of making some threads unbearable.

>>45 i'd be rather lonely.. ^^

hmm.. that syntax is pretty awful though, i still don't even know where to look to find the things it's supposed to be doing..

'mercury-rising' grade code obfuscation theory?
something worse than cargo-cult recursion?
'and maybe one day we'll go to rehab, or back to argentina...'

SICP may refer to:

    Structure and Interpretation of Computer Programs, pronounced “sick-pea”

not even pronounced "cisp"

mfw first published 1984
thousands of uni students, all with good english skills
still pronounced "sick-pea"
Sertified Genius

I guess that's what you get for not teaching yourselves..
YHBT so hard i almost feel bad for pointing it out..