Name:
Anonymous
2011-03-26 14:13
How would you explain lamda calculus to a little child?
Because I just don't understand the first thing about it.
Name:
Anonymous
2011-03-26 14:26
/prog/ would rape the child.
Name:
Anonymous
2011-03-26 14:51
>>1
(λx.T)s = T[x:=s]; (λx.x)y = y
TSU = (TS)U = ((TS)U); (λx.x)(λy.y)z = ((λx.x)(λy.y))z = (((λx.x)(λy.y))z) = ((λy.y)z) = z
(λxyz.T) = (λx.λy.λz.T)
S := (λxyz.xz(yz))
K := (λxy.y)
I := (SKK)
TRUE := (λxy.x)
FALSE := K
ZERO := FALSE
ONE := (λfx.fx)
TWO := (λfx.f(fx))
THREE := (λfx.f(fx))
SUCC := (λnfx.f(nfx))
PLUS := (λmnfx.(m SUCC n)fx)
Then the child should understand by itself.
Name:
Anonymous
2011-03-26 23:12
>>5
Define you're DSL, ``in Lisp'' guy.