This PR adds simprocs to simplify appends of non-overlapping Bitvector adds. We add a simproc instead of just a `simp` lemma to ensure that we correctly rewrite bitvector appends. Since bitvector appends lead to computation at the bitvector width level, it seems to be more stable to write a simproc. As I write this, I realize that I can maybe write the `simp` lemma using `no_index` to recover the same behaviour, so I'll try that too. |
||
|---|---|---|
| .. | ||
| bench | ||
| compiler | ||
| elabissues | ||
| ir | ||
| lean | ||
| pkg | ||
| playground | ||
| plugin | ||
| simpperf | ||
| .gitignore | ||
| common.sh | ||
| lean-toolchain | ||