• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
        • Warnings
        • Primitives
        • Use-set
        • Syntax
        • Getting-started
        • Utilities
          • Name-database
            • Vl-namedb
            • Vl-namedb-plain-name
            • Vl-namedb-pset-fix
            • Vl-namedb-plain-names
            • Vl-namedb-indexed-name
            • Vl-namedb-pmap-fix
            • Vl-unlike-any-prefix-p
            • Vl-namedb-pmap-okp
            • Vl-namedb-allnames
            • Vl-starting-namedb
              • Vl-pgenstr-highest
              • Vl-namedb-pset-okp
              • Vl-pgenstr-p
              • Vl-pgenstr->val
              • Vl-free-namedb
              • Vl-namedb-plain-name-quiet
              • Vl-pgenstr-highest-of-alist-keys
              • Vl-pgenstr
              • Vl-empty-namedb
              • Vl-namedb-nameset
              • Vl-unlike-any-prefix-p-of-alist-keys
              • Vl-namedb-prefixmap
            • Vl-gc
            • Make-lookup-alist
            • Symbol-list-names
            • Html-encoding
            • Nats-from
            • Redundant-mergesort
            • Longest-common-prefix
            • Vl-edition-p
            • Nat-listp
            • Vl-plural-p
            • Vl-remove-keys
            • Sum-nats
            • Vl-maybe-nat-listp
            • Url-encoding
            • Fast-memberp
            • Vl-string-keys-p
            • Max-nats
            • Longest-common-prefix-list
            • Character-list-listp
            • Vl-string-list-values-p
            • Vl-character-list-list-values-p
            • Remove-from-alist
            • Prefix-of-eachp
            • Vl-maybe-string-listp
            • Pos-listp
            • Vl-string-values-p
            • String-list-listp
            • True-list-listp
            • Symbol-list-listp
            • Explode-list
            • All-have-len
            • Min-nats
            • Debuggable-and
            • Vl-starname
            • Remove-equal-without-guard
            • String-fix
            • Longer-than-p
            • Clean-alist
            • Anyp
            • Or*
            • Fast-alist-free-each-alist-val
            • And*
            • Not*
            • Free-list-of-fast-alists
            • *nls*
          • Loader
          • Transforms
          • Lint
          • Mlib
          • Server
          • Kit
          • Printer
          • Esim-vl
          • Well-formedness
        • Sv
        • Fgl
        • Vwsim
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Name-database

    Vl-starting-namedb

    (vl-starting-namedb names) creates a name database that regards names as already in use.

    Signature
    (vl-starting-namedb names) → db
    Arguments
    names — Guard (string-listp names).
    Returns
    db — Type (vl-namedb-p db).

    Definitions and Theorems

    Function: vl-starting-namedb

    (defun vl-starting-namedb (names)
     (declare (xargs :guard (string-listp names)))
     (let ((__function__ 'vl-starting-namedb))
      (declare (ignorable __function__))
      (make-vl-namedb :names (make-lookup-alist (string-list-fix names))
                      :pmap nil
                      :pset nil)))

    Theorem: vl-namedb-p-of-vl-starting-namedb

    (defthm vl-namedb-p-of-vl-starting-namedb
      (b* ((db (vl-starting-namedb names)))
        (vl-namedb-p db))
      :rule-classes :rewrite)

    Theorem: vl-namedb-allnames-of-vl-starting-namedb

    (defthm vl-namedb-allnames-of-vl-starting-namedb
      (equal (vl-namedb-allnames (vl-starting-namedb names))
             (string-list-fix names)))

    Theorem: vl-starting-namedb-of-string-list-fix-names

    (defthm vl-starting-namedb-of-string-list-fix-names
      (equal (vl-starting-namedb (string-list-fix names))
             (vl-starting-namedb names)))

    Theorem: vl-starting-namedb-string-list-equiv-congruence-on-names

    (defthm vl-starting-namedb-string-list-equiv-congruence-on-names
      (implies (str::string-list-equiv names names-equiv)
               (equal (vl-starting-namedb names)
                      (vl-starting-namedb names-equiv)))
      :rule-classes :congruence)