Closed AtticusKuhn closed 2 months ago
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
@AtticusKuhn, what a success! 🎉 Turning my broken hack into such a beautiful proof.
I left many comments, but this is one of the most polished PRs I started reviewing. In retrospect, the proof seems straightforward, which is remarkable given the complex proof states one can reach. You broke it down into a couple of well-structured semantic pieces.
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
CC: @bollu @alexkeizer
I think this PR is in pretty good shape. I would appreciate if you would review it.
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
Alive Statistics: 64 / 93 (29 failed)
I am done.
Thank you for your guidance. Your feedback is very helpful.
Alive Statistics: 64 / 93 (29 failed)
If no one objects, then I am going to merge this PR because there has been no activity on it for three days.
Alive Statistics: 64 / 93 (29 failed)
This PR proves the key theorem
Which shows that subtraction on BitStreams corresponds to subtraction on BitVectors.
In doing so, this PR removes the last "sorry" from the file BitStream.lean.
Note that this PR is a continuation of PR https://github.com/opencompl/lean-mlir/pull/554