not directed, and so orderly at that.
with all its problems...
(nil, true, false, functions, numbers,...
may be implemented in the host as some place...)
Y: f.(x.f x x)(x.f x x)
Y g
(x.g x x)(x.g x x)
g (x.g x x)(x.g x x)
g g (...)
recursion by forgetting itself
A DRa`gon to be bound to something, someone,
in dear heart, or just illusioned will.
(a light and mocking heart, but
g has to see it all, all that it's done...
to itself though...)
fixed-point combinator à la Curry.
O: (x.y.y(x x y))(x.y.y(x x y))
"== (y.y((x.y.y(x x y))(x.y.y(x x y))y))"
O g
g((x.y.y(x x y))(x.y.y(x x y))g)
g(O g)
recursion by remembering itself
(in never-ending tragedy, deepest sorrow)
fixed-piont combinator à la Turing.
LUSTFORGREED
"additional notes."
0: f.x.x
"1: f.x.f x"
"2: f.x.f (f x)"
"3: f.x.f (f (f x))" "no need, thanks"
++: n.f.x.f (n f x)
--: "i don't know..."
+: m.n.m ++ n
-: m.n.m -- n
*: m.n.m (+ n) 0
^: b.e.e b
(f.x.f (f (f x))) ((f.x.f (f (f x))) a)
"dumb shit"
TAL: x.y.x
FAL: x.y.y
AND: p.q.p q p
OR: p.q.p p q
NOT: p.p FAL TAL
IF: p.a.b.p a b
0?: n.n (x.FAL) TAL
<=: m.n.0? (- m n)
"maybe dumb shit"
PIR: x.y.f.f x y
FIR: p.p TAL
SIR: p.p FAL
NIL: x.TAL
NUL: p.p (x.y.FAL)
#: x.PIR (SIR x) (++ (SIR x))
--: n.FIR (n # (PIR 0 0))
"more à la Curry"
I: x.x
S: x.y.z.x z (y z)
K: x.y.x
B: x.y.z.x (y z)
C: x.y.z.x z y
W: x.y.x y y
U: x.x x
Y: B U(C B U)