Theorem Provers: One Size Fits All?
By: Harrison Oates, Hyeonggeun Yun, Nikhila Gurusinghe
Potential Business Impact:
Helps choose the best computer proof tool.
Theorem provers are important tools for people working in formal verification. There are a myriad of interactive systems available today, with varying features and approaches motivating their development. These design choices impact their usability, alongside the problem domain in which they are employed. We test-drive two such provers, Coq and Idris2, by proving the correctness of insertion sort, before providing a qualitative evaluation of their performance. We then compare their community and library support. This work helps users to make an informed choice of system, and highlight approaches in other systems that developers might find useful.
Similar Papers
Hammering Higher Order Set Theory
Logic in Computer Science
Makes math proofs faster and easier for computers.
LogicLearner: A Tool for the Guided Practice of Propositional Logic Proofs
Discrete Mathematics
Helps students learn logic proofs with instant feedback.
Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
Logic in Computer Science
Creates math problems for AI to solve.