• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
        • Rp-ruleset
        • Defthmrp
        • Rp-rewriter/meta-rules
        • Rp-utilities
          • Defthmrp
          • Show-rules
          • Def-rw-opener-error
          • Valid-sc
            • Set-rp-backchain-limit
            • Fetch-new-theory
            • Ex-from-rp
            • Rp-other-utilities
            • Rp-equal
            • Preserve-current-theory
            • Set-rw-step-limit
            • Rp-termp
            • Include-fnc
            • Set-rp-backchain-limit-throws-error
            • Defwarrant-rp
            • Create-case-match-macro
          • Rp-rewriter-demo
          • Rp-rewriter/debugging
          • Rp-rewriter/applications
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Riscv
        • 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
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Rp-utilities

    Valid-sc

    A function that checks the side-conditions in a term is correct

    (valid-sc term a) traverses the term and evaluates the side-conditions. Whenever it encounters a term of the form (rp ''prop x), it calls (rp-evlt `(prop ,x) a). Whenever it encounters a term of the form (if test then else), it recursively calls valid-sc for the test; and 'then' and 'else' cases under the context of (rp-evlt test a)

    For every step that RP-Rewriter takes, we prove that valid-sc on terms are maintained. Therefore, users have to prove that meta-rules also retains this invariance.