Pre-RFC: Rank-N universal quantification (functions / closures)
Open
Nobody has claimed this yet.
A-typesystem
T-lang
- Dominant language
- Markdown
- Stars
- 6.6k
- Forks
- 1.7k
- Avg merge
- 16h 14m
- Merged PRs (30d)
- 1
Description
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 by reading the rendered Pre-RFC linked in the issue, which covers arbitrary-rank universal quantification for functions and closures. Compare the proposal with the Rust RFC process and determine whether the design has enough feedback and consensus to proceed; completion would require an accepted direction rather than a small code change.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100