Rewriting using Sort #72
Closed
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
This is a short script showcasing how rewriting could be done with the `Sort` types and a reference ACSet.
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## symbolicutilsinterop #72 +/- ##
=======================================================
Coverage ? 69.53%
=======================================================
Files ? 16
Lines ? 1129
Branches ? 0
=======================================================
Hits ? 785
Misses ? 344
Partials ? 0 ☔ View full report in Codecov by Sentry. |
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.
This PR is meant to showcase how do our Decapode typing and rewriting using the
Sorttype introduced in PR #64.This system would use metadata to transfer data from the ACSet to the symbolic variables and rely on predicates to do conditional rewriting (e.g. laplacian for 0-forms vs. 2-forms).