Recognizer for literal-type structures.
(literal-typep x) → *
Function:
(defun literal-typep (x) (declare (xargs :guard t)) (let ((__function__ 'literal-typep)) (declare (ignorable __function__)) (and (consp x) (cond ((or (atom x) (eq (car x) :boolean)) (and (true-listp (cdr x)) (eql (len (cdr x)) 0) (b* nil t))) ((eq (car x) :unsigned) (and (true-listp (cdr x)) (eql (len (cdr x)) 1) (b* ((size (std::da-nth 0 (cdr x)))) (leo-early::bitsizep size)))) ((eq (car x) :signed) (and (true-listp (cdr x)) (eql (len (cdr x)) 1) (b* ((size (std::da-nth 0 (cdr x)))) (leo-early::bitsizep size)))) ((eq (car x) :field) (and (true-listp (cdr x)) (eql (len (cdr x)) 0) (b* nil t))) ((eq (car x) :group) (and (true-listp (cdr x)) (eql (len (cdr x)) 0) (b* nil t))) ((eq (car x) :scalar) (and (true-listp (cdr x)) (eql (len (cdr x)) 0) (b* nil t))) ((eq (car x) :address) (and (true-listp (cdr x)) (eql (len (cdr x)) 0) (b* nil t))) (t (and (eq (car x) :string) (and (true-listp (cdr x)) (eql (len (cdr x)) 0)) (b* nil t)))))))
Theorem:
(defthm consp-when-literal-typep (implies (literal-typep x) (consp x)) :rule-classes :compound-recognizer)