leanprover / leanprover/comparator
comparator should permit dependent challenges ("Const does not match" is sometimes a lie)
Open
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 203
- Forks
- 36
- Avg merge
- 1h 40m
- Merged PRs (30d)
- 7
Description
Consider the challenge
theorem foo : 1 = 1 := sorry
theorem bar : foo = foo := sorry
with solution
theorem foo : 1 = 1 := Eq.refl _
theorem bar : foo = foo := Eq.refl _
comparator tells me that foo is a valid solution, but if I tell it that it should be comparing both foo and bar, it tells me uncaught exception: Const does not match between challenge and target 'foo'
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Reproduce the issue with the supplied Lean challenge and solution, first comparing only foo and then comparing both foo and bar. Investigate the comparator entry point that handles dependent declarations; done means both declarations compare successfully without the “Const does not match” exception.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 38/100