More Elisp linting

This should cover most of the remaining linting errors. After this, I expect
fewer than ten linting errors.

emacs/.emacs.d/wpc/stack.el

@@ -26,62 +26,62 @@
 ;; Create
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(defun stack/new ()
+(defun stack-new ()
   "Create an empty stack."
   (make-stack :xs '()))
 
-(defun stack/from-list (xs)
+(defun stack-from-list (xs)
   "Create a new stack from the list, `XS'."
-  (list/reduce (stack/new) #'stack/push xs))
+  (list-reduce (stack-new) #'stack-push xs))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;; Read
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(defun stack/peek (xs)
+(defun stack-peek (xs)
   "Look at the top element of `XS' without popping it off."
   (->> xs
        stack-xs
-       list/head))
+       list-head))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;; Update
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(defun stack/push (x xs)
+(defun stack-push (x xs)
   "Push `X' on `XS'."
   (struct-update stack
                  xs
-                 (>> (list/cons x))
+                 (>> (list-cons x))
                  xs))
 
-;; TODO: How to return something like {(list/head xs), (list/tail xs)} in Elixir
+;; TODO: How to return something like {(list-head xs), (list-tail xs)} in Elixir
 ;; TODO: How to handle popping from empty stacks?
-(defun stack/pop (xs)
+(defun stack-pop (xs)
   "Return the stack, `XS', without the top element.
 Since I cannot figure out a nice way of return tuples in Elisp, if you want to
-look at the first element, use `stack/peek' before running `stack/pop'."
+look at the first element, use `stack-peek' before running `stack-pop'."
   (struct-update stack
                  xs
-                 (>> list/tail)
+                 (>> list-tail)
                  xs))
 
-(defun stack/map-top (f xs)
+(defun stack-map-top (f xs)
   "Apply F to the top element of XS."
   (->> xs
-       stack/pop
-       (stack/push (funcall f (stack/peek xs)))))
+       stack-pop
+       (stack-push (funcall f (stack-peek xs)))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;; Miscellaneous
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(defun stack/to-list (xs)
+(defun stack-to-list (xs)
   "Return XS as a list.
-The round-trip property of `stack/from-list' and `stack/to-list' should hold."
+The round-trip property of `stack-from-list' and `stack-to-list' should hold."
   (->> xs
        stack-xs
-       list/reverse))
+       list-reverse))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;; Predicates
@@ -89,7 +89,7 @@ The round-trip property of `stack/from-list' and `stack/to-list' should hold."
 
 ;; TODO: Create a macro that wraps `cl-defstruct' that automatically creates
 ;; things like `new', `instance?'.
-(defun stack/instance? (xs)
+(defun stack-instance? (xs)
   "Return t if XS is a stack."
   (stack-p xs))