NiedzejKob personal blog
Compiling Rust is NP-hard
...though it's not the flagship borrow checking that's at fault. What I noticed, and would like to share with you today, is that the exhaustiveness checking performed by the Rust compiler on match patterns is a superset of the SAT problem.…
- Points
- 417
- HN comments
- 210
- Submissions
- 1
- Cited by
- 0 commenters
Programming LanguagesSoftware Engineering2021
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jul 8, 2021 | Compiling Rust is NP-hard by lovasoa | 417 | 210 |
