Boolean Logic with the SKI Combinators

boolean-expressions-ski.js

// S and K are primitive function combinators.
const S = a => b => c => a (c) (b (c))
const K = a => b => a

// Non-primitive combinators can be created with S and K.
const C = S (S (K (S (K (S)) (K))) (S)) (K (K))
const I = S (K) (K)
const KI = K (I)
const M = S (I) (I)
const R = S (K (S (K (S)) (K))) (S (K (S (I))) (K))

// Friendly Names given to combinators for readability.
const True = K
const False = KI
const Or = M // a => b => a (a) (b)
const And =  R (KI) // a => b => a (b) (a)
const Not = C

// /**
//  * 🔥🔥🔥 Boolean Logic 🔥🔥🔥
//  */
And (True)  (True)  ('🍉') ('🍒') //?
And (True)  (False) ('🍉') ('🍒') //?
And (False) (True)  ('🍉') ('🍒') //?
And (False) (False) ('🍉') ('🍒') //?

Or (True)  (True)  ('🍉') ('🍒') //?
Or (True)  (False) ('🍉') ('🍒') //?
Or (False) (True)  ('🍉') ('🍒') //?
Or (False) (False) ('🍉') ('🍒') //?

Not (True)  ('🍉') ('🍒') //?
Not (False) ('🍉') ('🍒') //?