Mechanically Verified Proofs for Union and Intersection Types with Integrated Subtyping

Fabian Muehlboeck from Cornell University created this dataset of formal proofs. The data likely contains machine-checked derivations supporting a paper on type theory. Metadata is minimal; the exact content and structure require verification after download.

Use Cases

• Validating type system properties using proof assistants (inferred from domain, verify after download)
• Benchmarking automated theorem provers on type theory problems (inferred from domain, verify after download)
• Teaching formal methods for programming language design (inferred from domain, verify after download)

Strengths

• Published on paperswithcode, a platform for machine learning research.
• Associated with a specific academic paper and author from Cornell University.

Limitations

• Metadata is minimal; actual content requires verification after download.
• Column-level documentation is absent; field semantics must be inferred after download.
• Row count and file formats are unknown, which may limit suitability assessment.

Provenance

Source

Fabian Muehlboeck, Cornell University