lean-ja / lean-ja/lean-by-example
m+n と n+m が区別される例
Open
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 188
- Forks
- 15
- Avg merge
- 9h 8m
- Merged PRs (30d)
- 6
Description
パターンマッチの枝において、m+1と1+mは区別される。これはsuccとdefeqであるかどうかという問題。
defeq と propeq の違いが問題になるケースでもある。「等しいのに、なぜ？」と思う可能性がある。
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
No file, test, or entry point is named in the issue. Start by locating the relevant pattern-matching example in the repository and review how it presents m+1 versus 1+m, succ, defeq, and propeq. Done means adding a clear example or explanation that shows why these apparently equal expressions can be distinguished.
Written by the indexing model from the issue text.
Assessment
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 48/100