• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
    • Ipasir
    • Aignet
    • Aig
    • Satlink
    • Truth
    • Ubdds
    • Bdd
    • Faig
    • Bed
    • 4v
      • 4v-sexprs
        • 4v-sexpr-vars
        • 4v-sexpr-eval
        • 4v-sexpr-to-faig
        • 4v-sexpr-restrict-with-rw
        • 4vs-constructors
        • 4v-sexpr-compose-with-rw
        • 4v-sexpr-restrict
        • 4v-sexpr-alist-extract
        • 4v-sexpr-compose
        • 4v-nsexpr-p
        • 4v-sexpr-purebool-p
        • 4v-sexpr-<=
        • Sfaig
        • Sexpr-equivs
        • 3v-syntax-sexprp
        • Sexpr-rewriting
          • 4v-shannon-expansion
          • Onehot-rewriting
          • 4v-sexpr-restrict-with-rw
          • 4v-sexpr-compose-with-rw
          • Sexpr-rewrite
          • Sexpr-rewrite-default
          • Sexpr-rewriting-internals
          • *sexpr-rewrites*
        • 4v-sexpr-ind
        • 4v-alist-extract
      • 4v-monotonicity
      • 4v-operations
      • Why-4v-logic
      • 4v-<=
      • 4vp
      • 4vcases
      • 4v-fix
      • 4v-lookup
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• 4v-sexprs

Sexpr-rewriting

Subtopics

4v-shannon-expansion

A conservative transformation of an s-expression that pulls a particular variable out into a top-level if-then-else.

Onehot-rewriting

Conservatively rewrite 4v-sexprs by assuming some variables are one-hot.

4v-sexpr-restrict-with-rw

4v-sexpr-restrict with inline rewriting.

4v-sexpr-compose-with-rw

4v-sexpr-compose with inline rewriting.

Sexpr-rewrite

Applies inside-out rewriting to an s-expression using a user-provided set of rewrite rules.

Sexpr-rewrite-default

Rewrite an s-expression with the default rewrite rules, *sexpr-rewrites*.

Sexpr-rewriting-internals

*sexpr-rewrites*

A useful set of 4v-s-expression rewrite rules, proven correct.