Added Sigma and Pi (FStar.SigmaPi.fst*) to ulib. #3691
Conversation
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
…nge style (#x #y .. (i:interval x (y+1))) to keep the proofs simple.
|
Hi Brian, this is useful, but I wonder if it could be derived as a special case of FStar.Algebra.CommMonoid.Fold, which is meant to model Big Sum/Big Product over an integer range but into for any commutative monoid, rather than {int, +} and {int, *} only. |
|
It should be able to be defined using that CommMonoidFold. I'll give it a whack. Hold this one open pls for an update. |
|
More reason to delay, trying to understand implicit variables in smtpats as per my questions and help post update. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Added Sigma and Pi (FStar.SigmaPi.fst*) to ulib. It uses the fixed range style (#x #y .. (i:interval x (y+1))) to keep the proofs simple. It refers to the wiki for named lambda proofs, which may be needed anyway but are avoided in the basic definitions.