Implemented the cons cell linked list data structure as well as reduce() using only recursive curried functions and closures.

closureListReduce.js

cons = a => b => f => f(a)(b)
car  = a => b => a
cdr  = a => b => b

reduce = f => i => l =>
  l
  ? reduce (f) (f(i)(l(car))) (l(cdr))
  : i

l = cons(1)(cons(2)(cons(3)(null)))

sum = x => y => x + y

reduce(sum)(0)(l)

closureListReduceObfuscated.js

(r = f => i => l => l ? r (f) (f(i)(l(a => b => a))) (l(a => b => b)) : i)(x => y => x + y)(0)((a => b => f => f(a)(b))(1)((a => b => f => f(a)(b))(2)((a => b => f => f(a)(b))(3)(null))))