• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
        • Deftreeops
        • Defdefparse
        • Defgrammar
        • Tree-utilities
        • Notation
        • Grammar-parser
        • Meta-circular-validation
        • Parsing-primitives-defresult
        • Parsing-primitives-seq
        • Operations
          • In-terminal-set
          • Closure
          • Well-formedness
            • Rulelist-incremental-ok-p
            • Num-val-wfp
            • Char-val-wfp
            • Prose-val-wfp
            • Rulename-wfp
            • Rulelist-wfp
              • Repeat-range-wfp
              • Rule-list-wfp
              • Concatenation-wfp
              • Alternation-wfp
              • Rule-wfp
              • Concatenation-list-wfp
              • Repetition-list-wfp
              • Repetition-wfp
              • Element-wfp
            • Plugging
            • Ambiguity
            • Renaming
            • Numeric-range-retrieval
            • Rule-utilities
            • Removal
            • Character-value-retrieval
          • Examples
          • Differences-with-paper
          • Constructor-utilities
          • Grammar-printer
          • Parsing-tools
        • Vwsim
        • Isar
        • Wp-gen
        • Dimacs-reader
        • Pfcs
        • Legacy-defrstobj
        • Proof-checker-array
        • Soft
        • C
        • Farray
        • Rp-rewriter
        • Riscv
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Des
        • Ethereum
        • X86isa
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Poseidon
        • Where-do-i-place-my-book
        • Axe
        • Aleo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Community
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Well-formedness

    Rulelist-wfp

    A rule list is well-formed iff all its rules are well-formed, there are no duplicate rules, and incremental rules follow non-incremental rules.

    Signature
    (rulelist-wfp rules) → yes/no
    Arguments
    rules — Guard (rulelistp rules).
    Returns
    yes/no — Type (booleanp yes/no).

    The first condition is structural. The second condition is justifiable because duplicate rules are redundant. The third condition is reasonably implied by [RFC:3.3].

    Non-emptiness is not required by the rule rulelist in [RFC:4], which allows just (*c-wsp c-nl) groups without rules.

    Definitions and Theorems

    Function: rulelist-wfp

    (defun rulelist-wfp (rules)
      (declare (xargs :guard (rulelistp rules)))
      (and (rule-list-wfp rules)
           (no-duplicatesp-equal rules)
           (rulelist-incremental-ok-p rules)))

    Theorem: booleanp-of-rulelist-wfp

    (defthm booleanp-of-rulelist-wfp
      (b* ((yes/no (rulelist-wfp rules)))
        (booleanp yes/no))
      :rule-classes :rewrite)