Programming languages and verification
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
16 records · Search and filter
- Math-4453 A fixed-basis semibasis certificate for DG-module interoperability
- Math-4491 Circular Assume–Guarantee Reasoning for General Systems
- Math-5042 Specialized algebra kernels and certified interoperability
- Math-5101 A typed plural-paper certificate for mathematical communication
- Math-5102 A semantics-bound certified bridge between Lean and computer algebra
- Math-5104 Ordered proof traces for sound educational interoperability
- Math-5108 Version-pinned workspace semantics for activities
- Math-5116 A semantic contract for journal-style theorem output
- Math-5137 A versioned capability contract for PreTeXt programming languages
- Math-5139 A semantic degradation contract and state lower bound for EPUB knowl fallbacks
- Math-5148 Truncation representatives, semantic equality certificates, and functorial cohomology maps
- Math-5189 Universal Semantic Communication Across Different Meanings
- Math-5238 Bit-Width-Independent Verification of Integer Multipliers
- Math-5293 Interoperable Virtual Laboratories for Scientific Simulation
- Math-5346 Formal Verification of AI-Generated Mathematical Proofs
- Math-5349 Scaling Paradigms for Lean Autoformalization