Showing 4 of 4 projects
A Coq library for constructive real analysis and algebra, including a model of real numbers and exact real computation.
A Coq-based competition for formally proving the largest constructive number within computational constraints.
Machine-checked constructive proofs of soundness, completeness, and decidability for modal logics K, K*, CTL, and PDL.
A modular Coq library providing constructive, axiom-free proofs of Kruskal's Tree Theorem and related results using almost full relations.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.