8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
Have a 8000 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
Currently, there is no common axiom scheme for normal and tautological congruence of sym-blocks.
This means that the user needs to add edge case axioms.
In order to avoid this, an axiom scheme should be designed such that congruence of sym-blocks is constructible.
nat_add_zero_left_cong : true -> cong'(sym(a, add'(z', a') == a'))
&
=>
|
The text was updated successfully, but these errors were encountered:
cong_app
I added a new axiom in #247:
sym_fun_eq : true -> sym(a, f(a')) == f
Sorry, something went wrong.
An idea:
cong'(f) -> cong'(sym(a, f(a') == b))
No branches or pull requests
Uh oh!
There was an error while loading. Please reload this page.
Currently, there is no common axiom scheme for normal and tautological congruence of sym-blocks.
This means that the user needs to add edge case axioms.
In order to avoid this, an axiom scheme should be designed such that congruence of sym-blocks is constructible.
Examples
nat_add_zero_left_cong : true -> cong'(sym(a, add'(z', a') == a'))
Basic operations
&
=>
|
The text was updated successfully, but these errors were encountered: