		Search-engine friendly clone of the ACL2 documentation.

Expression-optimization

Vl-arguments-optimize

Optimize expressions throughout a vl-arguments-p.

Signature
(vl-arguments-optimize x ss) → (mv changedp new-x)
Arguments: x — Guard (vl-arguments-p x).; ss — Guard (vl-scopestack-p ss).
Returns: changedp — Type (booleanp changedp).; new-x — Type (vl-arguments-p new-x).

Definitions and Theorems

Function: vl-arguments-optimize

(defun vl-arguments-optimize (x ss)
 (declare (xargs :guard (and (vl-arguments-p x)
                             (vl-scopestack-p ss))))
 (let ((__function__ 'vl-arguments-optimize))
  (declare (ignorable __function__))
  (b* ((x (vl-arguments-fix x)))
    (vl-arguments-case
         x :vl-arguments-named
         (b* (((mv changedp args-prime)
               (vl-namedarglist-optimize x.args ss)))
           (if (not changedp)
               (mv nil x)
             (mv t
                 (change-vl-arguments-named x
                                            :args args-prime))))
         :vl-arguments-plain
         (b* (((mv changedp args-prime)
               (vl-plainarglist-optimize x.args ss)))
           (if (not changedp)
               (mv nil x)
             (mv t
                 (change-vl-arguments-plain x
                                            :args args-prime))))))))

Theorem: booleanp-of-vl-arguments-optimize.changedp

(defthm booleanp-of-vl-arguments-optimize.changedp
  (b* (((mv ?changedp ?new-x)
        (vl-arguments-optimize x ss)))
    (booleanp changedp))
  :rule-classes :type-prescription)

Theorem: vl-arguments-p-of-vl-arguments-optimize.new-x

(defthm vl-arguments-p-of-vl-arguments-optimize.new-x
  (b* (((mv ?changedp ?new-x)
        (vl-arguments-optimize x ss)))
    (vl-arguments-p new-x))
  :rule-classes :rewrite)

Theorem: vl-arguments-optimize-of-vl-arguments-fix-x

(defthm vl-arguments-optimize-of-vl-arguments-fix-x
  (equal (vl-arguments-optimize (vl-arguments-fix x)
                                ss)
         (vl-arguments-optimize x ss)))

Theorem: vl-arguments-optimize-vl-arguments-equiv-congruence-on-x

(defthm vl-arguments-optimize-vl-arguments-equiv-congruence-on-x
  (implies (vl-arguments-equiv x x-equiv)
           (equal (vl-arguments-optimize x ss)
                  (vl-arguments-optimize x-equiv ss)))
  :rule-classes :congruence)

Theorem: vl-arguments-optimize-of-vl-scopestack-fix-ss

(defthm vl-arguments-optimize-of-vl-scopestack-fix-ss
  (equal (vl-arguments-optimize x (vl-scopestack-fix ss))
         (vl-arguments-optimize x ss)))

Theorem: vl-arguments-optimize-vl-scopestack-equiv-congruence-on-ss

(defthm vl-arguments-optimize-vl-scopestack-equiv-congruence-on-ss
  (implies (vl-scopestack-equiv ss ss-equiv)
           (equal (vl-arguments-optimize x ss)
                  (vl-arguments-optimize x ss-equiv)))
  :rule-classes :congruence)