-
Notifications
You must be signed in to change notification settings - Fork 123
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Exclusive enumeration #1085
Merged
Merged
Exclusive enumeration #1085
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
@robdockins #973 contains a good suggestion by you about setting the stride. Are you planning to tackle that here as well? |
I haven't thought about it much since I made that suggestion. Is that something you think people would find useful? |
Yes, and I didn't want to comment to disappear -- I see this PR is labeled "Fixes #973". Would you be willing to capture your idea in a new issue? |
CF #1087 |
brianhuffman
approved these changes
Mar 2, 2021
This allows us to express enumerations with exclusive upper bounds. In contrast with the `Literal` constraint, `LiteralLessThan n a` express that `a` contains all the literals strictly less than `n`, and explicitly allows `n` to be `inf` for unbounded types like `Integer` and `Rational`. It is possible to define `Literal n a` as `(fin n, LiteralLessThan (n+1) a)` instead of leaving it primitve. However, this makes infered types and error messages worse, IMO. As it stands, the typechecker has no real knowledge of the connection between `Literal` and `LiteralLessThan`.
`[ x .. < y ]` --> ``fromToLessThan`{first=x, bound=y}`` `[ x:t .. < y ]` --> ``fromToLessThan`{first=x, bound=y, a=t}``
robdockins
force-pushed
the
exclusive-enumeration
branch
from
March 3, 2021 01:25
c856d49
to
eb9d3e9
Compare
brianhuffman
pushed a commit
to GaloisInc/saw-script
that referenced
this pull request
Apr 7, 2021
…ons. This includes the following submodule PRs: - GaloisInc/cryptol#1085 "exclusive-enumeration" - GaloisInc/saw-core#188 "PLiteralLessThan"
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.
Add support for enumerations with exclusive upper bounds. This allows us to capture two different boundary conditions: empty sequences and infinite sequences.
As a result, we can redefine
generate
in a way that allows LHS indexing to likewise produce infinite and empty sequencesFixes #1063
Fixes #973
There are still some questions we need to answer regarding #1062.