		Search-engine friendly clone of the ACL2 documentation.

Jexpr-rank

Jexpr-rankp

Recognizer for jexpr-rank structures.

Signature
(jexpr-rankp x) → *

Definitions and Theorems

Function: jexpr-rankp

(defun jexpr-rankp (x)
  (declare (xargs :guard t))
  (let ((__function__ 'jexpr-rankp))
    (declare (ignorable __function__))
    (and (consp x)
         (cond ((or (atom x) (eq (car x) :expression))
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :assignment)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :conditional)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :conditional-or)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :conditional-and)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :inclusive-or)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :exclusive-or)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :and)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :equality)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :relational)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :shift)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :additive)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :multiplicative)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :unary)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :postfix)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               (t (and (eq (car x) :primary)
                       (and (true-listp (cdr x))
                            (eql (len (cdr x)) 0))
                       (b* nil t)))))))

Theorem: consp-when-jexpr-rankp

(defthm consp-when-jexpr-rankp
  (implies (jexpr-rankp x) (consp x))
  :rule-classes :compound-recognizer)