Seq vs List Correspondence #1302
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
…age similar to fun-op-sem/imp, but uses lists for sequencing
…with larger clock
…k given appropriate initial clock
…al clock for terminating programs in fun-op-sem/imp
adamstucci
force-pushed
the
equiv-PR
branch
from
8dae847
to
3876af1
Compare
|
Closing to break up into separate PRs |
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.
Current imperative example uses a tree structure for sequential composition
This PR adds a similar example language that instead uses lists for sequences of statements
Proofs to show that any (terminating) program in one language can be written as a program in the other
Please critique
Proofs are verbose and could be simplified