# Can we have a separate tag for combinatory logic?

Background information: Combinatory logic on Wikipedia

Basically it is a model of computation closely related to lambda calculus, but using a fixed set of combinators instead of lambda abstraction. The most prominent form of this is SKI (or SK) combinator calculus, which is extensionally equivalent to lambda calculus and therefore is Turing-complete (essentially a Turing tarpit).

I've identified nine challenges that are directly related to combinatory logic.

Some of these are tagged , but it isn't directly relevant to lambda calculus per se. So, can we have a separate tag for combinatory logic?

• – Wheat Wizard Mod
Jun 4, 2021 at 6:33