Skip to content

[ refactor ] introduce revised notation for decidability of Lexicographic orderings, plus knock-ons#2963

Open
jamesmckinna wants to merge 1 commit intoagda:masterfrom
jamesmckinna:decidable-lex
Open

[ refactor ] introduce revised notation for decidability of Lexicographic orderings, plus knock-ons#2963
jamesmckinna wants to merge 1 commit intoagda:masterfrom
jamesmckinna:decidable-lex

Conversation

@jamesmckinna
Copy link
Collaborator

@jamesmckinna jamesmckinna commented Mar 9, 2026

Last item (for now!?) on the #2846 shopping list.

Usual issues, with a twist:

  • global consistency of the R? notation, against the local of R-* style for all the other properties
  • inconsistency between List and Vec get reconciled here
  • Lex relations, and their proof of decidability, are ternary, so open question about what 'good'/'best' mixfix notations for such things should/could/might be deployed... suggestions below
  • a reminder that the Dec ordering relation structures/bundles have perhaps a sub-optimal inheritance graph?
  • clearly some non-trivial interaction with [ refactor ] name of Data.Product.Relation.Binary.Pointwise.NonDependent.×-decidable #2958 so there may be merge conflicts downstream?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant