We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
LLVM contains a collection of test cases of the form X % C0 + (( X / C0 ) % C1) * C0 to X % (C0 * C1) (where C0 * C1 does not overflow). These result in theorems such as the ones in: https://github.com/opencompl/lean-mlir/blob/main/SSA/Projects/InstCombine/tests/proofs/gadd4_proof.lean.
X % C0 + (( X / C0 ) % C1) * C0
X % (C0 * C1)
C0 * C1
https://grosser.zulipchat.com/#narrow/channel/446584-Project---Lean4---BitVectors/topic/slow.20division.20and.20transformation/near/491379687
The text was updated successfully, but these errors were encountered:
bollu
No branches or pull requests
LLVM contains a collection of test cases of the form
X % C0 + (( X / C0 ) % C1) * C0
toX % (C0 * C1)
(whereC0 * C1
does not overflow). These result in theorems such as the ones in:https://github.com/opencompl/lean-mlir/blob/main/SSA/Projects/InstCombine/tests/proofs/gadd4_proof.lean.
https://grosser.zulipchat.com/#narrow/channel/446584-Project---Lean4---BitVectors/topic/slow.20division.20and.20transformation/near/491379687
The text was updated successfully, but these errors were encountered: