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
parse rewrite forall vars. ∧_i a_i => l = r
rewrite forall vars. ∧_i a_i => l = r
same for clausal rewriting
handling by inference rule that unifies (rewrite & narrowing are the same)
`∧_i a_i => l = r C[l] lσ=a ---------------------------------------- ∧_i a_iσ => C[rσ]
which is a form of superposition that is artificially restricted to rewriting l first
l
for each rule, compile fast pre-checks (e.g. matched term must have symbol f at arg position i) and use these before attempting call to matching
f
i
matching
in proof, put set of rewrite rules used in simplification steps, at least in full (non-compressed) version
The text was updated successfully, but these errors were encountered:
No branches or pull requests
parse
rewrite forall vars. ∧_i a_i => l = r
same for clausal rewriting
handling by inference rule that unifies (rewrite & narrowing are the same)
which is a form of superposition that is artificially restricted to
rewriting
l
firstfor each rule, compile fast pre-checks (e.g.
matched term must have symbol
f
at arg positioni
) and usethese before attempting call to
matching
in proof, put set of rewrite rules used in simplification steps,
at least in full (non-compressed) version
The text was updated successfully, but these errors were encountered: