You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Closes#3778#3601
This PR introduces a simple check implication implementation, which uses
the matching algorithm to try to find a substitution or fail to unify
the given configurations.
If matching the RHS configuration to the LHS succeeds and produces a
substitution σ, we filter out any predicates in the consequent which
appear in the antecedent and then check if all predicates in
σ(filtered_preds) evaluate to true/#top. (Question: do we want to apply
σ to the RHS preds before filtering?). With this simple algorithm, we
can successfully discharge almost 85% of implication checks in KEVM and
88% in Kontrol.
---------
Co-authored-by: github-actions <github-actions@github.com>
Technically we should return valid rather than satisfiable here:
haskell-backend/kore-rpc-types/src/Kore/JsonRpc/Types.hs
Line 142 in 740a60e
The text was updated successfully, but these errors were encountered: