This code turns a SAT problem in DIMACS CNF format into Rust code that compiles iff the SAT problem is unsatisfiable, thus proving that compiling Rust is NP-hard. See the blog post for details.
-
Notifications
You must be signed in to change notification settings - Fork 1
Makes rustc's exhaustiveness checker solve SAT problems
License
Apache-2.0, MIT licenses found
Licenses found
Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
meithecatte/rustc-sat
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Makes rustc's exhaustiveness checker solve SAT problems
Resources
License
Apache-2.0, MIT licenses found
Licenses found
Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published