Предикат, который проверяет, является ли простой список чисел монотонной последовательностью

;racket
(define (foo lst pred)
    (if (null? (cdr lst)) #t
        (and (pred (car lst) (cadr lst)) (foo (cdr lst) pred))))

(defun is-mon (lst)
  (let ((a1 (apply '<= lst))
        (a2 (apply '>= lst)))
       (or a1 a2)))
 
==> is-mon
 
(is-mon '(1 2 3 4))
 
==> T
 
(is-mon '(1 2 -1 3 4))
 
==> NIL
 
(is-mon '(4 3 2 1))
 
==> T
 
(is-mon '(4 4 4 4))
 
==> T

(defun monotonic (w)
  (or (apply #'>= w) (apply #'<= w)))
 
> (monotonic '(1 2 2 3))
T

(defun monotonic (w)
  (or (mono w #'<=) (mono w #'>=)))
 
(defun mono (w p)
  (if (cdr w)
      (and (funcall p (car w) (cadr w))
           (mono (cdr w) p))
      t))
 
> (monotonic '(10 2 2 3))
NIL
> (monotonic '(1 2 2 3))
T
> (monotonic '(3 2 2 1))
T

(defun monotonic (w)
  (or (mono w #'<) (mono w #'>)))
 
(defun mono (w p)
  (cond ((null (cdr w)))
        ((funcall p (car w) (cadr w)) nil)
        ((mono (cdr w) p))))
 
> (monotonic '(3 2 2 1))
T
> (monotonic '(1 2 2 3))
T
> (monotonic '(10 2 2 3))
NIL

(defun monotonicp (pred fun l) ;монотонность ф-ции
            (loop for (a b) on l
               while b always
                 (funcall pred (funcall fun a)
                          (funcall fun b))))
INSOMNIA> (monotonicp #'< #'sin (list-range (/ pi -2) (/ pi 2) .01))
T
INSOMNIA> (monotonicp #'< #'sin (list-range (/ pi -2) (/ pi 1.5) .01))
NIL

(defun monotonic (w)
  (or (mono w #'<=) (mono w #'>=)))
 
(defun mono (w p) 
  (loop for (a b) on w
        while b always (funcall p a b)))
 
> (monotonic '(3 2 2 1))
T
> (monotonic '(1 2 2 3))
T
> (monotonic '(10 2 2 3))
NIL

(defun is-mon (lst &optional (f 0))
   (cond ((null (cdr lst)) t)
         ((= (car lst) (cadr lst)) (is-mon (cdr lst) f))
         ((zerop f) (is-mon (cdr lst) (if (> (car lst) (cadr lst)) 1 -1)))  
         ((= f (if (> (car lst) (cadr lst)) 1 -1)) (is-mon (cdr lst) f))
         (t nil)))
 
(is-mon '(1 2 3 -4 5))
 
==> NIL
 
(is-mon '(1 2 3 4 5))
 
==> T
 
(is-mon '(1 2 3 3 3 4 5 5 5))
 
==> T
 
(is-mon '(1 2 3 3 3 4 5 50 5))
 
==> NIL
 
(is-mon '(1 2 3 3 3 4 5 50 55))
 
==> T
 
(is-mon '(1 1 1 1 2 3 3 3 4 5 50 55))
 
==> T

(defun monotonic-p (lst)
    ( (lambda (f-rec)
       (f-rec (if (<= (car lst) (cadr lst)) <= >=)
          (cdr lst)))
      (lambda (acc lst)
    (if (cddr lst)
      (if (acc (car lst) (cadr lst))
        (f-rec acc (cdr lst)))
      T))))