mirror of
https://github.com/Z3Prover/z3
synced 2025-10-04 06:53:58 +00:00
Fix some typos. (#7075)
This commit is contained in:
parent
ec2b8eb4ca
commit
d66df2616f
8 changed files with 10 additions and 10 deletions
|
@ -69,7 +69,7 @@ The formal properties of saturation have to be established.
|
|||
- Saturation does not complete with respect to associativity.
|
||||
Instead the claim is along the lines that the resulting E-graph can be used as a canonizer.
|
||||
If given a set of equations E that are saturated, and terms t1, t2 that are
|
||||
both simplified with respect to left-associativity of concatentation, and t1, t2 belong to the E-graph,
|
||||
both simplified with respect to left-associativity of concatenation, and t1, t2 belong to the E-graph,
|
||||
then t1 = t2 iff t1 ~ t2 in the E-graph.
|
||||
|
||||
TODO: Is saturation for (7) overkill for the purpose of canonization?
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue