-
Notifications
You must be signed in to change notification settings - Fork 131
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
Proof checker cannot collapse constant arithmetic #3
Comments
Yeah, Puffs should be able to prove this. The question is whether this is done implicitly or explicitly. The explicit version would mean that you'd have to write something like
There is already a very similar, existing explicit 'via' rule called "a < (b + c): a < c; 0 <= b", used in Both of those could possibly become implicit, eventually, so you wouldn't have to write explicit assert lines in the program. But it's not obvious yet where to draw the line exactly between a fast-and-dumb proof checker and a full blown smart-and-slow SMT solver. |
What should the next step be
…On Nov 27, 2017 5:42 PM, "Nigel Tao" ***@***.***> wrote:
Yeah, Puffs should be able to prove this. The question is whether this is
done implicitly or explicitly. The explicit version would mean that you'd
have to write something like
assert outIdx < 400 via "a < b: (a + c) < b; 0 <= c"(c:2)
There is already a very similar, existing explicit 'via' rule called "a <
(b + c): a < c; 0 <= b", used in std/gif/decode_lzw.puffs.
Both of those could possibly become implicit, eventually, so you wouldn't
have to write explicit assert lines in the program. But it's not obvious
yet where to draw the line exactly between a fast-and-dumb proof checker
and a full blown smart-and-slow SMT solver.
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#3 (comment)>, or mute
the thread
<https://github.com/notifications/unsubscribe-auth/AgM_UM31pl3T2F4hCfi2eOoN5iMzn-Zqks5s6zrOgaJpZM4Qqd9q>
.
|
So how should one comment when placed in that spot, I agree fast and dumb is like being ones self like retardedly genius. Acronym |
If you want to just play around with the built-in rules, edit If you want to push those rules upstream, that's a bigger conversation. For example, that would probably involve also taking the Puffs code that requires those new rules, and thus a discussion of whether whatever it is your Puffs code does belongs in the Puffs standard library.
Sorry, I don't understand your question. |
Fact:
(outIdx + 2) < 400
What I expect:
outIdx < 400 is provable
Observed:
"cannot prove "outIdx < 400": failed at (...). Facts:
[. . .]
(outIdx + 2) < 400
The text was updated successfully, but these errors were encountered: