• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Projects
  • Debugging
  • 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-comment
        • Lex-whitespace
        • Lex1
        • Lex-main
        • Lex*
        • Tokenlist-p
        • Idtail-char-p
        • Letter-char-p
        • Whitespace-char-p
          • Whitespace-charlist-p
            • Whitespace-charlist-p-basics
          • Whitespace-chars
        • Number-char-p
        • Tokentype-p
        • Lex*-exec
        • Newline-string
      • Sin
      • Matching-functions
      • Def-sin-progress
    • Tshell
    • Unsound-eval
    • Hacker
    • Startup-banner
    • Command-line
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• Whitespace-char-p

Whitespace-charlist-p

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

Signature

(whitespace-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: whitespace-charlist-p

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

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

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

Subtopics

Whitespace-charlist-p-basics

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