-
Notifications
You must be signed in to change notification settings - Fork 0
Union, Intersection, Set Difference and Further Operations on Indexed Sets #92
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
Conversation
9d7aa59 to
1b05961
Compare
ibbem
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There is also a variable declaraction at the top of the IndexedSet file which also should be changed to private.
Moving proofs into a separate Properties submodule sound like a godd idea indeed.
1270497 to
038b18b
Compare
038b18b to
d873e07
Compare
|
I created issue #93 for extracting the theorems in |
This PR continues #85.
I implemented the operations in this PR's title and a few more. These also act as sanity checks for Indexed Sets and the proofs turned to work out like a charm.
Maybe we should consider to separate definitions and proofs (including existing proofs in
src/Vatras/Data/IndexedSet.lagda.md) by moving the proofs into asrc/Vatras/Data/IndexedSet/Properties.agdafile.