Skip to content

[Refractor] contradiction over ⊥-elim in Data.*.Relation.Binary.Lex.* #2671

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

Merged
merged 4 commits into from
Mar 19, 2025

Conversation

jmougeot
Copy link
Contributor

No description provided.

@jmougeot jmougeot changed the title [Refractor] contradiction over ⊥-elim inData/Vec/Relation/Binary/Strict [Refractor] contradiction over ⊥-elim in Data/Vec/Relation/Binary/Strict Mar 13, 2025
jamesmckinna
jamesmckinna previously approved these changes Mar 14, 2025
@jamesmckinna jamesmckinna changed the title [Refractor] contradiction over ⊥-elim in Data/Vec/Relation/Binary/Strict [Refractor] contradiction over ⊥-elim in Data.Vec.Relation.Binary.Lex.Strict Mar 17, 2025
@jamesmckinna
Copy link
Contributor

Suggest, however, also touching Data.Vec.Relation.Binary.Lex.Core to remove dependency on Data.Empty in favour of Relation.Nullary.Negation.Core.contradiction... not quite sure how this slipped through!?

@jamesmckinna jamesmckinna dismissed their stale review March 17, 2025 12:19

Discovered a relevant change which should be committed before proceeding.

Copy link
Contributor

@jamesmckinna jamesmckinna left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Additionally: fix Data.Vec.Relation.Binary.Lex.Core as suggested in line with the rest of these PRs, and mutatis mutandis, Data.List.Relation.Binary.Lex.Strict as well!

Copy link
Contributor

@jamesmckinna jamesmckinna left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Final narrowing(s)?

@jamesmckinna
Copy link
Contributor

Also https://github.com/jmougeot/agda-stdlib/blob/34d3fe0ce97d6252b277a547c68b1ad5f3cf2855/src/Data/List/Relation/Binary/Lex/Strict.agda#L14-L15:

open import Data.Empty using (⊥)
open import Data.Unit.Base using (⊤; tt)

can be streamlined to:

open import Data.Unit.Base using (tt)

and if you don't mind replacing tt with _ throughout (which it can, by eta-expansion for the record type ...), even this can be deleted as well.

@jamesmckinna jamesmckinna changed the title [Refractor] contradiction over ⊥-elim in Data.Vec.Relation.Binary.Lex.Strict [Refractor] contradiction over ⊥-elim in Data.*.Relation.Binary.Lex.* Mar 17, 2025
Copy link
Contributor

@jamesmckinna jamesmckinna left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yup, I think this will do fine.
Thanks for taking the trouble to cross-propagate changes between the List and Vec versions of these relations... interesting to see what's common and what's not!
cf. #2679

@jamesmckinna
Copy link
Contributor

@JacquesCarette are you happy to approve and merge now?

@JacquesCarette JacquesCarette added this pull request to the merge queue Mar 19, 2025
Merged via the queue into agda:master with commit e00111c Mar 19, 2025
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants