-
Notifications
You must be signed in to change notification settings - Fork 273
Simplify quantified expressions over constants #8608
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
base: develop
Are you sure you want to change the base?
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## develop #8608 +/- ##
========================================
Coverage 80.37% 80.37%
========================================
Files 1686 1686
Lines 206885 206928 +43
Branches 73 73
========================================
+ Hits 166276 166312 +36
- Misses 40609 40616 +7 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
It's unfortunately not that easy: The domain may be empty, and then ∀x.false is true, and ∃x.true is false. |
Now fixed, and fixed the implementation in the propositional back-end as well. |
Other simplification rules may turn the where-clause of a quantified expression into a (Boolean) constant. We can completely remove such quantified expressions so as not to distract back-ends that may special-case quantified expressions. We saw such expressions when working on mlkem-native.
Other simplification rules may turn the where-clause of a quantified expression into a (Boolean) constant. We can completely remove such quantified expressions so as not to distract back-ends that may special-case quantified expressions.
We saw such expressions when working on mlkem-native.