• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
    • Io
    • Defttag
    • Sys-call
    • Save-exec
    • Quicklisp
    • Oslib
    • Std/io
    • Bridge
    • Clex
      • Example-lexer
        • Token-p
        • Lex-punctuation
        • Lex-id/keyword
        • Lex-string
        • Lex-whitespace
        • Lex-comment
        • Lex1
        • Lex-main
        • Lex*
        • Tokenlist-p
        • Letter-char-p
        • Idtail-char-p
        • Whitespace-char-p
        • Number-char-p
          • Number-charlist-p
            • Number-charlist-p-basics
          • Number-chars
        • Tokentype-p
        • Lex*-exec
        • Newline-string
      • Sin
      • Matching-functions
      • Def-sin-progress
    • Tshell
    • Unsound-eval
    • Hacker
    • ACL2s-interface
    • Startup-banner
    • Command-line
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Number-char-p

Number-charlist-p

(number-charlist-p x) recognizes lists where every element satisfies number-char-p.

Signature

(number-charlist-p x) → std::bool

This is an ordinary deflist. It is "loose" in that it does not care whether x is nil-terminated.

Definitions and Theorems

Function: number-charlist-p

(defun number-charlist-p (x)
  (declare (xargs :guard t))
  (let ((__function__ 'number-charlist-p))
    (declare (ignorable __function__))
    (if (consp x)
        (and (number-char-p (car x))
             (number-charlist-p (cdr x)))
      t)))

Theorem: chars-in-charset-p-of-number-chars

(defthm chars-in-charset-p-of-number-chars
  (equal (chars-in-charset-p x (number-chars))
         (number-charlist-p x)))

Subtopics

Number-charlist-p-basics

Basic theorems about number-charlist-p, generated by deflist.