[Merged by Bors] - feat(Order/Partition): add refinement order#36574
[Merged by Bors] - feat(Order/Partition): add refinement order#36574Jun2M wants to merge 12 commits intoleanprover-community:masterfrom
Conversation
PR summary 68e18bf8edImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
YaelDillies
left a comment
There was a problem hiding this comment.
This PR is doing too many things at once. Could you move out everything past the refinement order?
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
Co-authored-by: Yaël Dillies <[email protected]>
This PR expands the API for `Partition s` Introduces a `PartialOrder (Partition s)` instance where partitions are ordered by refinement (`P ≤ Q` if every part of `P` is contained in a part of `Q`). Also adds an `OrderTop` instance where the top partition consists of the single part `s`. Co-authored-by: Peter Nelson <[email protected]>
|
Pull request successfully merged into master. Build succeeded: |
This PR expands the API for `Partition s` Introduces a `PartialOrder (Partition s)` instance where partitions are ordered by refinement (`P ≤ Q` if every part of `P` is contained in a part of `Q`). Also adds an `OrderTop` instance where the top partition consists of the single part `s`. Co-authored-by: Peter Nelson <[email protected]>
This PR expands the API for
Partition sIntroduces a
PartialOrder (Partition s)instance where partitions are ordered by refinement (P ≤ Qif every part ofPis contained in a part ofQ). Also adds anOrderTopinstance where the top partition consists of the single parts.Co-authored-by: Peter Nelson [email protected]