• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Error-checking
      • Apt
      • Abnf
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Prime-field-constraint-systems
      • Soft
      • Bv
      • Imp-language
      • Event-macros
      • Bitcoin
      • Ethereum
      • Yul
      • Zcash
      • ACL2-programming-language
      • Prime-fields
      • Java
      • C
      • Syntheto
      • Number-theory
      • Cryptography
      • Lists-light
      • File-io-light
      • Json
      • Built-ins
      • Solidity
      • Axe
      • Std-extensions
        • Std/util-extensions
        • Std/basic-extensions
          • Mbt$
          • Organize-symbols-by-pkg
          • Organize-symbols-by-name
          • Good-valuep
          • Symbol-package-name-non-cl
          • Symbol-package-name-lst
          • Good-pseudo-termp
          • Maybe-string-fix
          • Std/basic/if*
          • Std/basic/member-symbol-name
        • Std/strings-extensions
        • Std/system-extensions
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Execloader
    • Axe
  • Testing-utilities
  • Math

• Std/basic-extensions
• Std/basic

Organize-symbols-by-name

Organize a list of symbols by their names.

Signature

(organize-symbols-by-name syms) → syms-by-name

Arguments

syms — Guard (symbol-listp syms).

Returns

syms-by-name — Type (string-symbollist-alistp syms-by-name), given the guard.

The result is an alist from symbol names (strings) to the non-empty lists of the symbols that have the respective names.

The alist has unique keys, and each of its values has no duplicates.

Definitions and Theorems

Function: organize-symbols-by-name-aux

(defun
 organize-symbols-by-name-aux (syms acc)
 (declare (xargs :guard (and (symbol-listp syms)
                             (string-symbollist-alistp acc))))
 (let
    ((__function__ 'organize-symbols-by-name-aux))
    (declare (ignorable __function__))
    (b* (((when (endp syms)) acc)
         (sym (car syms))
         (name (symbol-name sym))
         (prev-syms-for-name (cdr (assoc-equal name acc))))
        (organize-symbols-by-name-aux
             (cdr syms)
             (put-assoc-equal name
                              (add-to-set-eq sym prev-syms-for-name)
                              acc)))))

Theorem: string-symbollist-alistp-of-organize-symbols-by-name-aux

(defthm
   string-symbollist-alistp-of-organize-symbols-by-name-aux
   (implies
        (and (symbol-listp syms)
             (string-symbollist-alistp acc))
        (b* ((syms-by-name (organize-symbols-by-name-aux syms acc)))
            (string-symbollist-alistp syms-by-name)))
   :rule-classes :rewrite)

Function: organize-symbols-by-name

(defun organize-symbols-by-name (syms)
       (declare (xargs :guard (symbol-listp syms)))
       (let ((__function__ 'organize-symbols-by-name))
            (declare (ignorable __function__))
            (organize-symbols-by-name-aux syms nil)))

Theorem: string-symbollist-alistp-of-organize-symbols-by-name

(defthm
     string-symbollist-alistp-of-organize-symbols-by-name
     (implies (and (symbol-listp syms))
              (b* ((syms-by-name (organize-symbols-by-name syms)))
                  (string-symbollist-alistp syms-by-name)))
     :rule-classes :rewrite)