-
Notifications
You must be signed in to change notification settings - Fork 247
add proof for ¬ lex< xs []
?
#602
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
Comments
I'd write the type as |
Yup, I agree, useful addition and |
I do not understand (do not recall) what is a pull request.
, then he adds this code to Data.List.Relation.Lex.Core for the next library version, and will add a notice to CHANGELOG.md. |
@mechvel a pull request (PR) is exactly what we helped you through in #65. You may also find out how to prepare one in the HACKING file if you've forgotten. Although I could do it myself, it works better if everyone else helps too. This way you yourself can contribute to the library, and in future can help make bigger changes such as incorporating your Bin library. |
I had difficulties with pull request, was not able to accomplish it without your help. |
While I am at it: PR #1648 only resolved this issue for |
Hmmm. Those changes (on branch |
Yes, if the changes you want to preserve are heavily localised to a single place then it's often easier to copy them across to a fresh branch rather than try to merge. |
Data.List.Relation.Lex.Core
defines_<_ = Lex P _≈_ _≺_
,and I discover that
\_ -> \lambda()
does not prove∀ xs → ¬ _<_ xs []
May be, it worth to add there (or somewhere)
?
The text was updated successfully, but these errors were encountered: