Open
Description
Fascinating how these next proofs are essentially the
cancel
andelim
(left and right) combinators inCategories.Morphism.Reasoning
!
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.
Metadata
Metadata
Assignees
Labels
No labels