• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
      • Rule-classes
      • Proof-builder
      • Recursion-and-induction
      • Hons-and-memoization
      • Events
      • Parallelism
      • History
      • Programming
        • Defun
        • Declare
        • System-utilities
        • Stobj
        • State
        • Mutual-recursion
        • Memoize
        • Mbe
        • Io
        • Defpkg
        • Apply$
        • Loop$
        • Programming-with-state
        • Arrays
        • Characters
        • Time$
        • Defconst
        • Fast-alists
        • Defmacro
        • Loop$-primer
        • Evaluation
        • Guard
        • Equality-variants
        • Compilation
        • Hons
        • ACL2-built-ins
        • Developers-guide
        • System-attachments
        • Advanced-features
        • Set-check-invariant-risk
        • Numbers
        • Efficiency
        • Irrelevant-formals
        • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
        • Redefining-programs
        • Lists
        • Invariant-risk
        • Errors
        • Defabbrev
        • Conses
        • Alists
        • Set-register-invariant-risk
        • Strings
          • Std/strings
          • String-listp
          • Stringp
          • Length
          • Search
          • Remove-duplicates
          • Position
          • Coerce
          • Concatenate
          • Reverse
          • String
          • Subseq
          • Substitute
          • String-upcase
          • String-downcase
          • Count
          • Char
          • String<
          • String-equal
          • 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
          • String-append
          • String>=
          • String<=
          • String>
          • Hex-digit-char-theorems
          • String-downcase-gen
          • String-upcase-gen
        • Program-wrapper
        • Get-internal-time
        • Basics
        • Packages
        • Oracle-eval
        • Defmacro-untouchable
        • <<
        • Primitive
        • Revert-world
        • Unmemoize
        • Set-duplicate-keys-action
        • Symbols
        • Def-list-constructor
        • Easy-simplify-term
        • Defiteration
        • Fake-oracle-eval
        • Defopen
        • Sleep
      • Operational-semantics
      • Real
      • Start-here
      • Miscellaneous
      • Output-controls
      • Bdd
      • Macros
      • Installation
      • Mailing-lists
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • 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.