rocq-prover / rocq-prover/stdlib
`NoDup_dec` definition is opaque
Open
Nobody has claimed this yet.
- Dominant language
- Rocq Prover
- Stars
- 42
- Forks
- 38
- Avg merge
- 14h 6m
- Merged PRs (30d)
- 3
Description
The decidability of the NoDup predicate (NoDup_dec) is defined with Qed instead of Defined, which makes it opaque and thus makes it impossible to compute with it.
For example, other proofs of decidability of list operations (e.g. in_dec or list_eq_dec) are defined as transparent.
Contributor guide
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
Locate the NoDup_dec definition and compare its proof terminator with the transparent in_dec and list_eq_dec definitions mentioned in the issue. Change the definition so it is transparent, then verify that NoDup_dec can compute as intended.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Bug
- Difficulty
- 1/5
- Estimated time
- Under an hour
- Activity status
- Stale
- Clarity
- Clearly specified
- Newbie friendliness
- 50/100