NOT READY Compute syntactic transitive closure for select relational symbols #3940
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Opened this draft too early. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Related to #3861
This PR adds a routine to compute a syntactic transitive closure if a certain relational symbol in a given set of applications of this symbol.
See module Booster.Pattern.PartialOrder for the implementation and [Test.Booster.Pattern.PartialOrder(https://github.com/runtimeverification/haskell-backend/blob/georgy%2Fpartial-order-transitive-closure/booster/unit-tests/Test/Booster/Pattern/PartialOrder.hs#L13) for the unit-tests.
Application
This routine, in conjunction with syntactic inference of
requiresfrom the path condition, should allow us to solve some side-conditions completely syntactically, i.e. without calling the SMT solver or event the applying equations.