• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/io
      • Std/osets
      • Std/system
      • Std/basic
      • Std/typed-lists
        • Std/typed-lists/character-listp
        • Std/typed-lists/symbol-listp
        • Std/typed-lists/boolean-listp
        • Std/typed-lists/string-listp
        • Std/typed-lists/eqlable-listp
        • Theorems-about-true-list-lists
        • Std/typed-lists/atom-listp
        • Unsigned-byte-listp
        • Cons-listp
        • Cons-list-listp
          • Cons-list-listp-basics
        • Signed-byte-listp
        • String-or-symbol-listp
      • Std/bitsets
      • Std/testing
      • Std/typed-alists
      • Std/stobjs
      • Std-extensions
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Testing-utilities
    • Math
  • Std/typed-lists

Cons-list-listp

(cons-list-listp x) recognizes lists where every element satisfies cons-listp.

Signature
(cons-list-listp x) → std::bool

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

Definitions and Theorems

Function: cons-list-listp

(defun cons-list-listp (x)
       (declare (xargs :guard t))
       (let ((__function__ 'cons-list-listp))
            (declare (ignorable __function__))
            (if (consp x)
                (and (cons-listp (car x))
                     (cons-list-listp (cdr x)))
                t)))

Subtopics

Cons-list-listp-basics
Basic theorems about cons-list-listp, generated by std::deflist.