HW.fork lowering : lemmas and refactoring#1982
Draft
luisacicolini wants to merge 6 commits into
Draft
Conversation
luisacicolini
changed the title
HW.fork lowering : second partHW.fork lowering : lemmas and refactoring
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
In this PR, we refactor the existing proof of bisimilarity for the lowering of the
forkcomponent. We extract meaningful lemmas, creating a library and sufficient API to reason about the concretization of cycles in the lowering from a latency-insensitive abstraction.