Reverse a linked list

ListReverse.js

// Q. Reverse a linked list.

// What is linked list?
const cons = h => t => f => f(h)(t)

// What is boolean?
const T = a => b => a
const F = a => b => b

// What is integer?
const N0 = f => a
const N1 = f => a => f(a)
const N2 = f => a => f(f(a))
const N3 = f => a => f(f(f(a)))

// Define a list of `1 -> 2 -> 3`.
const NIL = cons(F)(F)
const ISNIL = p => p(T)(T(F))(T)
const x = cons(N1)(cons(N2)(cons(N3)(NIL)))

// Print it.
const print = l =>
  ISNIL(l)
    (() => {
      console.log("@");
    })
    (() => {
      console.log(l(T))
      print(l(F));
    })
    () // for lazy eval

print(x)

// Reverse it.
const rev = l => r =>
  ISNIL(l)
    (() => r)
    (() => rev(l(F))(cons(l(T))(r)))
    () // <- for lazy eval

print(rev(x)(NIL))