[mufeedvh]

Funny you mention that, because yes, a combinator-style encoding is probably a cleaner fit for the “only six colors constraint than my stack machine. I hacked together a tiny SKI-flavored M&M reducer as a proof of concept: B=S, G=K, R=I, Y=(, O=), and N... is a free atom, so `B G G NNN` reduces to `a2`.

Gist: https://gist.github.com/mufeedvh/db930a423fdce8c1d8e495c7a3f...

[AdieuToLogic]

That is too cool, thanks again for sharing your exploration.

I suppose the only question remaining is if peanut M&Ms are higher-kinded when contrasted with the chocolate-only nullary type.

:-D