" For example, recursion in lambda calculus does not need names. " You are right. Just a zest of Y-combinator and you can forget names as it is shown in sectio

" For example, recursion in lambda calculus does not need names. " You are right. Just a zest of Y-combinator and you can forget names as it is shown in section 4). And so you come back to pure lambda calculus. If you want more details have a look at http://lambdaway.free.fr/lambdaspeech/?view=kiss http://lambdaway.free.fr/lambdaspeech/?view=kiss and http://lambdaway.free.fr/lambdaspeech/?view=factory_201902_paper http://lambdaway.free.fr/lambdaspeech/?view=factory_201902_p... So, I'm disapointed that nobody could understand that my question about Tao was somewhat provocative. A bit of humour. A more serious point, IMHO, is the similarity between Yin/Yang and Abstraction/Application. Your opinion?