Recognizer for name+value structures.
(name+value-p x) → *
Function:
(defun name+value-p (x) (declare (xargs :guard t)) (let ((__function__ 'name+value-p)) (declare (ignorable __function__)) (and (consp x) (eq (car x) :name+value) (mbe :logic (and (alistp (cdr x)) (equal (strip-cars (cdr x)) '(name value))) :exec (fty::alist-with-carsp (cdr x) '(name value))) (b* ((name (cdr (std::da-nth 0 (cdr x)))) (value (cdr (std::da-nth 1 (cdr x))))) (and (identifierp name) (valuep value))))))
Theorem:
(defthm consp-when-name+value-p (implies (name+value-p x) (consp x)) :rule-classes :compound-recognizer)