• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
      • Sv
        • Svex-stvs
        • Svex-decomposition-methodology
        • Sv-versus-esim
        • Svex-decomp
        • Svex-compose-dfs
        • Svex-compilation
        • Moddb
        • Svmods
          • Address
          • Wire
          • Module
          • Lhs
            • Lhs.lisp
            • Lhs-p
              • Lhs-p-basics
            • Lhs-fix
            • Lhrange
            • Lhs-eval-zx
            • Lhs-equiv
            • Lhs-eval
            • Lhs->svex
          • Path
          • Svar-add-namespace
          • Design
          • Modinst
          • Lhs-add-namespace
          • Modalist
          • Path-add-namespace
          • Modname->submodnames
          • Name
          • Constraintlist-addr-p
          • Svex-alist-addr-p
          • Svar-map-addr-p
          • Lhspairs-addr-p
          • Modname
          • Assigns-addr-p
          • Lhs-addr-p
          • Lhatom-addr-p
          • Modhier-list-measure
          • Attributes
          • Modhier-measure
          • Modhier-list-measure-aux
          • Modhier-loopfreelist-p
          • Modhier-loopfree-p
        • Svstmt
        • Sv-tutorial
        • Expressions
        • Symbolic-test-vector
        • Vl-to-svex
      • Fgl
      • Vwsim
      • Vl
      • X86isa
      • Svl
      • Rtl
    • Software-verification
    • Math
    • Testing-utilities
  • Lhs

Lhs-p

(lhs-p x) recognizes lists where every element satisfies lhrange-p.

Signature
(lhs-p x) → *

This is an ordinary std::deflist. It is "strict" in that it requires x to be a "properly" nil-terminated list.

Subtopics

Lhs-p-basics
Basic theorems about lhs-p, generated by std::deflist.