Fully Abstract Module Compilation, formal proofs is a dataset from paperswithcode. The dataset likely contains formal proofs related to module compilation in a mathematical or computer science context. It was authored by Karl Crary of Carnegie Mellon University and is licensed as Open Access (green).
Use Cases
- Verifying properties of module compilation systems (inferred from domain, verify after download)
- Training or evaluating theorem provers on formal proof structures (inferred from domain, verify after download)
- Studying the semantics of fully abstract compilation (inferred from domain, verify after download)
Strengths
- Published on paperswithcode, a platform for machine learning research.
- Authored by a researcher from Carnegie Mellon University.
- Licensed as Open Access (green), facilitating reuse.
Limitations
- Metadata is minimal; actual content requires verification after download.
- Column-level documentation is absent; field semantics must be inferred after download.
- Row count, file formats, and last update date are unknown.
Provenance
- Source
- paperswithcode