runtimeverification / runtimeverification/mir-semantics
[FEAT] Tackle impossible cases with minimal requirements
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 52
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
In #888, we use ensure (0 ==Int #lookupDiscrAux(discriminant(0) discriminant(1) .Discriminants, ?SplHasDelegateKey) orBool 1 ==Int #lookupDiscrAux(discriminant(0) discriminant(1) .Discriminants, ?SplHasDelegateKey)) to avoid unreachable cases.
However, 0 <=Int ?SplHasDelegateKey andBool ?SplHasDelegateKey <=Int 1 and the definiton of #lookupDiscrAux should already give enough information that it should be 0 or 1 for this #lookupDiscrAux.
Could we provide a way to avoid this redundant ensure clause?
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
Start with issue #888 and inspect the definition and uses of #lookupDiscrAux, especially the case involving ?SplHasDelegateKey and the listed discriminants. Determine how the existing bounds establish the 0-or-1 result and identify a project-supported way to eliminate the redundant ensure clause; done means the impossible cases no longer require that explicit ensure.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100