Talk:Qu-Qu

Could you please specify each function a little more? its unclear what each does(for example null), and just generally how this language works(evaluation order, ect.). --Yayimhere2(school) (talk) 19:01, 18 January 2026 (UTC)

Every program is a tree; a function will branch out on its inputs.

x(y(x))

Lower-case x will check for y, and y will check for x. So y(x) is solved first, then x(y(x)) is solved. --A() (talk) 19:34, 18 January 2026 (UTC)

Still, null has not been described. Please do so --Yayimhere2(school) (talk) 11:30, 19 January 2026 (UTC)

Also, note that your "opposite" function isnt well defined. It is not the inverse of a function(as shown by XK=K') so what is it?? --Yayimhere2(school) (talk) 12:15, 19 January 2026 (UTC)

Null is just f(x) (church numerals), and X is just some fancy garbage that speeds up the process. In fact, the X and U are not needed and are just stuff for proving things. -- A() (talk) 14:54, 19 January 2026 (UTC)

But you have to define X. Also is NULL=f(x)???? Would it be like, NULL=\f.\x.f(x)?

Yes it would be. Also in retrospect, I feel like X is the not gate. -- A() (talk) 15:13, 19 January 2026 (UTC)

By your definition of its effect on K, then yes it is. Now go write the stuff you just defined up on the page. Also, your increment doesnt work by the definition your just agreed on. If correct it would be λn.λf.λx.f (n f x). --Yayimhere2(school) (talk) 15:16, 19 January 2026 (UTC)

Also, Null should propably defined as ø(x)=ø(x). --Yayimhere2(school) (talk) 15:17, 19 January 2026 (UTC)