• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Debugging
    • Projects
    • 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
          • Omaps
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Checkpoint-list
          • Context-message-pair
          • Numbered-names
          • Digits-any-base
          • With-auto-termination
          • Theorems-about-true-list-lists
          • Make-termination-theorem
          • Sublis-expr+
          • Prove$
          • Defthm<w
          • System-utilities-non-built-in
          • Integer-range-fix
          • Add-const-to-untranslate-preprocess
          • Integers-from-to
          • Minimize-ruler-extenders
          • Unsigned-byte-fix
          • Signed-byte-fix
          • Defthmr
          • Paired-names
          • Unsigned-byte-list-fix
          • Signed-byte-list-fix
          • Show-books
          • Checkpoint-list-pretty
          • List-utilities
          • Skip-in-book
          • Typed-tuplep
          • Defunt
          • Keyword-value-list-to-alist
          • Magic-macroexpand
          • Top-command-number-fn
          • Bits-as-digits-in-base-2
          • Show-checkpoint-list
          • Ubyte11s-as-digits-in-base-2048
          • Named-formulas
          • Bytes-as-digits-in-base-256
          • String-utilities
            • Code-char-injectivity-theorem
            • 8bitbytes-hexchars-conversions
            • Code-char-inverses-theorems
            • String-kinds
            • String-codelist-conversions
              • String=>nats
                • Nats<=>string-inverses-theorems
              • Nats=>string
            • Charlist-codelist-conversions
            • 8bitbytes-hexstrings-conversions
          • Make-keyword-value-list-from-keys-and-value
          • Integer-range-listp
          • Defmacroq
          • Apply-fn-if-known
          • Trans-eval-error-triple
          • Checkpoint-info-list
          • Previous-subsumer-hints
          • Fms!-lst
          • Zp-listp
          • Doublets-to-alist
          • Trans-eval-state
          • Injections
          • Theorems-about-osets
          • Typed-list-utilities
          • Book-runes-alist
          • User-interface
          • Bits/ubyte11s-digit-grouping
          • Bits/bytes-digit-grouping
          • Message-utilities
          • Subsetp-eq-linear
          • Strict-merge-sort-<
          • Miscellaneous-enumerations
          • Maybe-unquote
          • Oset-utilities
          • Thm<w
          • Defthmd<w
        • 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
        • Htclient
        • Typed-lists-light
        • Arithmetic-light
      • X86isa
      • Execloader
      • Axe
    • Testing-utilities
    • Math
  • String-codelist-conversions

String=>nats

Convert a string to the corresponding true list of natural numbers below 256.

Signature
(string=>nats string) → nats
Arguments
string — Guard (stringp string).
Returns
nats — Type (unsigned-byte-listp 8 nats).

Definitions and Theorems

Function: string=>nats

(defun string=>nats (string)
       (declare (xargs :guard (stringp string)))
       (let ((__function__ 'string=>nats))
            (declare (ignorable __function__))
            (chars=>nats (explode string))))

Theorem: return-type-of-string=>nats

(defthm return-type-of-string=>nats
        (b* ((nats (string=>nats string)))
            (unsigned-byte-listp 8 nats))
        :rule-classes :rewrite)

Theorem: nat-listp-of-string=>nats

(defthm nat-listp-of-string=>nats
        (b* ((nats (string=>nats string)))
            (nat-listp nats))
        :rule-classes :rewrite)

Theorem: len-of-string=>nats

(defthm len-of-string=>nats
        (implies (stringp string)
                 (equal (len (string=>nats string))
                        (length string))))

Theorem: nth-of-string=>nats

(defthm nth-of-string=>nats
        (equal (nth n (string=>nats string))
               (if (< (nfix n) (len (explode string)))
                   (char-code (char string n))
                   nil)))

Theorem: consp-of-string=>nats

(defthm consp-of-string=>nats
        (iff (consp (string=>nats string))
             (consp (explode string))))

Theorem: string=>nats-of-implode

(defthm string=>nats-of-implode
        (implies (character-listp chars)
                 (equal (string=>nats (implode chars))
                        (chars=>nats chars))))

Theorem: string=>nats-of-str-fix-string

(defthm string=>nats-of-str-fix-string
        (equal (string=>nats (str-fix string))
               (string=>nats string)))

Theorem: string=>nats-streqv-congruence-on-string

(defthm string=>nats-streqv-congruence-on-string
        (implies (streqv string string-equiv)
                 (equal (string=>nats string)
                        (string=>nats string-equiv)))
        :rule-classes :congruence)

Subtopics

Nats<=>string-inverses-theorems
nats=>string and string=>nats are mutual inverses.