-
Notifications
You must be signed in to change notification settings - Fork 428
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat: BitVec.toNat BitVec.signExtend #6155
Merged
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
github-actions
bot
added
the
toolchain-available
A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN
label
Nov 21, 2024
Mathlib CI status (docs):
|
changelog-library |
kim-em
reviewed
Nov 21, 2024
kim-em
reviewed
Nov 21, 2024
kim-em
reviewed
Nov 21, 2024
github-merge-queue bot
pushed a commit
that referenced
this pull request
Nov 23, 2024
This PR adds toInt theorems for BitVec.signExtend. If the current width `w` is larger than the extended width `v`, then the value when interpreted as an integer is truncated, and we compute a modulo by `2^v`. ```lean theorem toInt_signExtend_of_le (x : BitVec w) (hv : v ≤ w) : (x.signExtend v).toInt = Int.bmod (x.toNat) (2^v) ``` Co-authored-by: Siddharth Bhat <[email protected]> Co-authored-by: Harun Khan <[email protected]> Stacked on top of #6155 --------- Co-authored-by: Harun Khan <[email protected]>
bollu
force-pushed
the
toNat_signExtend
branch
from
November 26, 2024 13:40
ce3177c
to
989e783
Compare
This PR adds toNat theorems for BitVec.signExtend. Sign extending to a larger bitwidth depends on the msb. If the msb is false, then the result equals the original value. If the msb is true, then we add a value of `(2^v - 2^w)`, which arises from the sign extension. ```lean theorem toNat_signExtend (x : BitVec w) {v : Nat} : (x.signExtend v).toNat = (x.setWidth v).toNat + if x.msb then 2^v - 2^w else 0 ``` Co-authored-by: Siddharth Bhat <[email protected]> Co-authored-by: Harun Khan <[email protected]>
bollu
force-pushed
the
toNat_signExtend
branch
from
November 26, 2024 14:32
989e783
to
623f626
Compare
awaiting-review |
github-actions
bot
added
awaiting-review
Waiting for someone to review the PR
and removed
awaiting-author
Waiting for PR author to address issues
labels
Nov 26, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
changelog-library
Library
toolchain-available
A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds
toNat
theorems forBitVec.signExtend.
Sign extending to a larger bitwidth depends on the msb. If the msb is false, then the result equals the original value. If the msb is true, then we add a value of
(2^v - 2^w)
, which arises from the sign extension.