rocq-prover / rocq-prover/stdlib
binary and octal number notations
Nobody has claimed this yet.
- Dominant language
- Rocq Prover
- Stars
- 42
- Forks
- 38
- Avg merge
- 14h 6m
- Merged PRs (30d)
- 3
Description
I think it would be nice to support printing and parsing of binary and octal constants in addition to hexadecimal ones. In addition it might make sense to factor out DecimalFacts and HexadecimalFacts to be parameterized over, say,
digits : Type
all_digits : list digits
digit_index : digits -> nat
all_digits_complete : forall d, List.nth_error all_digits (digit_index d) = Some d
all_digits_unique : forall n d, List.nth_error all_digits n = Some d -> digit_index d = n
and then to have proofs about list digits. This should allow compact proofs for all base systems.
cc @proux01, what do you think?
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
The issue names no files, tests, or entry points. Start by locating the existing hexadecimal parsing and printing code, then inspect DecimalFacts and HexadecimalFacts and their proofs. Done means binary and octal constants are supported and the shared facts can cover all base systems without breaking existing hexadecimal behavior.
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