Extend an alist by binding the names of vl-programs to their definitions.
(vl-programlist-alist x acc) → alist
This can be used as an alternative to vl-find-program when you need to perform a lot of lookups.
Function:
(defun vl-programlist-alist (x acc) (declare (xargs :guard (vl-programlist-p x))) (let ((__function__ 'vl-programlist-alist)) (declare (ignorable __function__)) (if (atom x) acc (cons (cons (vl-program->name (car x)) (vl-program-fix (car x))) (vl-programlist-alist (cdr x) acc)))))
Theorem:
(defthm return-type-of-vl-programlist-alist (b* ((alist (vl-programlist-alist x acc))) (equal (vl-program-alist-p alist) (vl-program-alist-p acc))) :rule-classes :rewrite)
Theorem:
(defthm lookup-in-vl-programlist-alist-acc-elim (implies (syntaxp (not (equal acc ''nil))) (equal (hons-assoc-equal name (vl-programlist-alist x acc)) (or (hons-assoc-equal name (vl-programlist-alist x nil)) (hons-assoc-equal name acc)))))
Theorem:
(defthm lookup-in-vl-programlist-alist-fast (implies (stringp name) (equal (hons-assoc-equal name (vl-programlist-alist x nil)) (let ((val (vl-find-program name x))) (and val (cons name val))))))
Theorem:
(defthm vl-programlist-alist-of-vl-programlist-fix-x (equal (vl-programlist-alist (vl-programlist-fix x) acc) (vl-programlist-alist x acc)))
Theorem:
(defthm vl-programlist-alist-vl-programlist-equiv-congruence-on-x (implies (vl-programlist-equiv x x-equiv) (equal (vl-programlist-alist x acc) (vl-programlist-alist x-equiv acc))) :rule-classes :congruence)