10 ms·
That ignores its first argument x. You mean the fixpoint combinator λf.(λx.f(x x))(λx.f(x x)), or λf.(λx.x x)(λx.f(x x)), or as a lambda diagram: ────┬───
by tromp 2y ago
That ignores its first argument x.
You mean the fixpoint combinator λf.(λx.f(x x))(λx.f(x x)), or λf.(λx.x x)(λx.f(x x)), or as a lambda diagram:
────┬────
┬─┬ ┼─┬─┬
└─┤ │ ├─┘
│ ├─┘
└─┘
- tromp 2y agoI would say the combinator \x\y\z.x z (y (\t.z)) is more poetic than Y, since it forms a basis for combinatory logic all by itself. Not only can you make Y from it, but every other combinator as well. And it's the smallest term with that property.