Rework $ operator to work like applicative in Haskell

f $ g $ h -> f(g(h)) whereas previous implementation ($ f g h) was
h(g(f)).

lib.macros.lisp

@@ -82,7 +82,7 @@ arguments `LAMBDA-LIST' with body `BODY'."
   "Given a sequence of FORMS, return a unary function which applies each form
 sequentially"
   `(lambda (x)
-     (->> x ,@forms)))
+     (->> x ,@(reverse forms))))
 
 (defmacro alist-val (key alist)
   "Helper macro for getting the value of KEY in ALIST."