I wrote:
> While playing with @pl on #haskell, I noticed some
> weird and surprising lambda identities. For example:
> let {c = (.); c4 = c c c c}
> Then we have:
> c c4 == c c4 c c c c
> You get a lot more interesting stuff when you
> throw flip into the mix.
> Anyone know more about these things?
apfelmus pointed out that my "c" is the B
combinator:
http://en.wikipedia.org/wiki/Combinatory_logic#Combinators_B.2C_C
And flip is (essentially) the B combinator.
Any other references?
Thanks,
Yitz