-
Notifications
You must be signed in to change notification settings - Fork 246
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
Adding new reasoning combinators #2288
Comments
Naming:
|
|
Looks worth pursuing! ... perhaps provided there are concrete instances in the library that could usefully be refactored to exploit these new combinators? (Hint: any PR introducing them should at least attempt to do an amount of such refactoring as well?) |
Further thoughts: already in |
Originally posted by @JacquesCarette in #2251 (comment)
The point would be that for binary operations for which we have congruence (i.e. everything above Magma), there are additional combinators that we can create. Even more above Semigroup, where we also get associativity, and also Monoid (unital).
So we should get more and more reasoning power as we move up.
EDIT:
Categories.Morphism.Reasoning
The text was updated successfully, but these errors were encountered: