Handling deep list recursion

I want to handle the recursion situation when list is too big.  
What would be the best plan when it is too long?  Catch the error 
if it happens and continue with nonlocal exit than continues with
cl-every?  Of compute the length beforehand?

(defun lana-alistp (object &optional recursive)
  "Non-nil if and only if OBJECT is a valid alist.
Validate every element is proper (KEY . VALUE) cons cell."

  (declare (pure t) (side-effect-free error-free))
  (when (proper-list-p object)
    (if recursive
	(cond ((atom object)  (eq object nil))
              (t  (and (consp (car object))
                       (lana-alistp (cdr object)))))
      (cl-every #'consp object))))