• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
      • Svex-stvs
      • Svex-decomposition-methodology
      • Sv-versus-esim
      • Svex-decomp
      • Svex-compose-dfs
      • Svex-compilation
      • Moddb
      • Svmods
        • Address
        • Wire
        • Module
        • Lhs
        • Path
        • Svar-add-namespace
        • Design
        • Modinst
          • Modinst-fix
          • Modinst-equiv
          • Make-modinst
          • Modinst->modname
          • Modinst->instname
          • Change-modinst
          • Modinstlist
            • Modinstlist-fix
            • Modinstlist->instnames
            • Modinstlist->modnames
            • Modinstlist-p
            • Modinstlist-equiv
          • Modinst-p
        • Lhs-add-namespace
        • Modalist
        • Path-add-namespace
        • Modname->submodnames
        • Name
        • Constraintlist-addr-p
        • Svex-alist-addr-p
        • Svar-map-addr-p
        • Lhspairs-addr-p
        • Modname
        • Assigns-addr-p
        • Lhs-addr-p
        • Lhatom-addr-p
        • Modhier-list-measure
        • Attributes
        • Modhier-measure
        • Modhier-list-measure-aux
        • Modhier-loopfreelist-p
        • Modhier-loopfree-p
      • Svstmt
      • Sv-tutorial
      • Expressions
      • Symbolic-test-vector
      • Vl-to-svex
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Modinstlist

Modinstlist->instnames

(modinstlist->instnames x) maps modinst->instname across a list.

Signature

(modinstlist->instnames x) → names

Arguments

x — Guard (modinstlist-p x).

Returns

names — Type (namelist-p names).

This is an ordinary defprojection.

Definitions and Theorems

Function: modinstlist->instnames-exec

(defun modinstlist->instnames-exec (x acc)
  (declare (xargs :guard (modinstlist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'modinstlist->instnames-exec))
    (declare (ignorable __function__))
    (if (consp x)
        (modinstlist->instnames-exec
             (cdr x)
             (cons (modinst->instname (car x)) acc))
      acc)))

Function: modinstlist->instnames-nrev

(defun modinstlist->instnames-nrev (x acl2::nrev)
  (declare (xargs :stobjs (acl2::nrev)))
  (declare (xargs :guard (modinstlist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'modinstlist->instnames-nrev))
    (declare (ignorable __function__))
    (if (atom x)
        (acl2::nrev-fix acl2::nrev)
      (let ((acl2::nrev (acl2::nrev-push (modinst->instname (car x))
                                         acl2::nrev)))
        (modinstlist->instnames-nrev (cdr x)
                                     acl2::nrev)))))

Function: modinstlist->instnames

(defun modinstlist->instnames (x)
  (declare (xargs :guard (modinstlist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'modinstlist->instnames))
    (declare (ignorable __function__))
    (mbe :logic
         (if (consp x)
             (cons (modinst->instname (car x))
                   (modinstlist->instnames (cdr x)))
           nil)
         :exec
         (if (atom x)
             nil
           (acl2::with-local-nrev
                (modinstlist->instnames-nrev x acl2::nrev))))))

Theorem: namelist-p-of-modinstlist->instnames

(defthm namelist-p-of-modinstlist->instnames
  (b* ((names (modinstlist->instnames x)))
    (namelist-p names))
  :rule-classes :rewrite)

Theorem: modinstlist->instnames-of-modinstlist-fix-x

(defthm modinstlist->instnames-of-modinstlist-fix-x
  (equal (modinstlist->instnames (modinstlist-fix x))
         (modinstlist->instnames x)))

Theorem: modinstlist->instnames-modinstlist-equiv-congruence-on-x

(defthm modinstlist->instnames-modinstlist-equiv-congruence-on-x
  (implies (modinstlist-equiv x x-equiv)
           (equal (modinstlist->instnames x)
                  (modinstlist->instnames x-equiv)))
  :rule-classes :congruence)

Theorem: modinstlist->instnames-of-take

(defthm modinstlist->instnames-of-take
  (implies (<= (nfix acl2::n) (len x))
           (equal (modinstlist->instnames (take acl2::n x))
                  (take acl2::n (modinstlist->instnames x))))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-nrev-removal

(defthm modinstlist->instnames-nrev-removal
  (equal (modinstlist->instnames-nrev x acl2::nrev)
         (append acl2::nrev (modinstlist->instnames x)))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-exec-removal

(defthm modinstlist->instnames-exec-removal
  (equal (modinstlist->instnames-exec x acl2::acc)
         (revappend (modinstlist->instnames x)
                    acl2::acc))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-of-rev

(defthm modinstlist->instnames-of-rev
  (equal (modinstlist->instnames (rev x))
         (rev (modinstlist->instnames x)))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-of-list-fix

(defthm modinstlist->instnames-of-list-fix
  (equal (modinstlist->instnames (list-fix x))
         (modinstlist->instnames x))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-of-append

(defthm modinstlist->instnames-of-append
  (equal (modinstlist->instnames (append acl2::a acl2::b))
         (append (modinstlist->instnames acl2::a)
                 (modinstlist->instnames acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: cdr-of-modinstlist->instnames

(defthm cdr-of-modinstlist->instnames
  (equal (cdr (modinstlist->instnames x))
         (modinstlist->instnames (cdr x)))
  :rule-classes ((:rewrite)))

Theorem: car-of-modinstlist->instnames

(defthm car-of-modinstlist->instnames
  (equal (car (modinstlist->instnames x))
         (and (consp x)
              (modinst->instname (car x))))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-under-iff

(defthm modinstlist->instnames-under-iff
  (iff (modinstlist->instnames x)
       (consp x))
  :rule-classes ((:rewrite)))

Theorem: consp-of-modinstlist->instnames

(defthm consp-of-modinstlist->instnames
  (equal (consp (modinstlist->instnames x))
         (consp x))
  :rule-classes ((:rewrite)))

Theorem: len-of-modinstlist->instnames

(defthm len-of-modinstlist->instnames
  (equal (len (modinstlist->instnames x))
         (len x))
  :rule-classes ((:rewrite)))

Theorem: true-listp-of-modinstlist->instnames

(defthm true-listp-of-modinstlist->instnames
  (true-listp (modinstlist->instnames x))
  :rule-classes :type-prescription)

Theorem: modinstlist->instnames-when-not-consp

(defthm modinstlist->instnames-when-not-consp
  (implies (not (consp x))
           (equal (modinstlist->instnames x) nil))
  :rule-classes ((:rewrite)))

Theorem: modinstlist->instnames-of-cons

(defthm modinstlist->instnames-of-cons
  (equal (modinstlist->instnames (cons acl2::a acl2::b))
         (cons (modinst->instname acl2::a)
               (modinstlist->instnames acl2::b)))
  :rule-classes ((:rewrite)))