Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
From LCF to HOL: a short history
Proof, language, and interaction
A New Implementation of Automath
Journal of Automated Reasoning
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
A formally verified proof of the prime number theorem
ACM Transactions on Computational Logic (TOCL)
The Four Colour Theorem: Engineering of a Formal Proof
Computer Mathematics
Twenty Years of Theorem Proving for HOLs Past, Present and Future
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
About the Formalization of Some Results by Chebyshev in Number Theory
Types for Proofs and Programs
Social processes, program verification and all that
Mathematical Structures in Computer Science
A short survey of automated reasoning
AB'07 Proceedings of the 2nd international conference on Algebraic biology
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Proof, message and certificate
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Theory presentation combinators
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.01 |
In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions.