Some considerations on the usability of interactive provers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6167 LNAI, Issue , 2010, Pages 147-156

  Asperti, Andrea ^a   Sacerdoti Coen, Claudio ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FORMAL REASONING; SECOND GENERATION; USABILITY OF INTERACTIVE PROVERS;

MACHINERY;

EID: 77954879675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14128-7_13     Document Type: Conference Paper

References (23)

1. Asperti, A., Geuvers, H., Natarajan, R.: Social processes, program verification and all that. Mathematical Structures in Computer Science 19(5), 877-896 (2009)
2. Asperti, A., Ricciotti, W.: About the formalization of some results by Chebyshev in number theory. In: Berardi, S., Damiani, F., de'Liguoro, U. (eds.) TYPES 2008. LNCS, vol.5497, pp. 19-31. Springer, Heidelberg (2009)
3. Asperti, A., Tassi, E.: Smart matching. In: Autexier, S., et al. (eds.) AISC/Calculemus/ MKM 2010. LNCS (LNAI), vol.6167, pp. 263-277. Springer, Heidelberg (2010)
4. Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Trans. Comput. Log. 9(1) (2007)
5. Constable, R.L., Allen, S.F., Bromley, H.M., Cleaveland, W.R., Cremer, J.F., Harper, R.W., Howe, D.J., Knoblock, T.B., Mendler, N.P., Panangaden, P., Sasaki, J.T., Smith, S.F.: ImplementingMathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs (1986)
6. Escobar, S., Meseguer, J., Thati, P.: Narrowing and rewriting logic: from foundations to applications. Electr. Notes Theor. Comput. Sci. 177, 5-33 (2007)
7. Geuvers, H.: Proof Assistants: history, ideas and future. Sadhana 34(1), 3-25 (2009)
8. Gonthier, G.: The four colour theorem: Engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol.5081, p. 333. Springer, Heidelberg (2008)
9. Gonthier, G.: Formal proof - the four color theorem. Notices of the American Mathematical Society 55, 1382-1394 (2008)
10. Gordon, M.: From lcf to hol: a short history. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 169-186. MIT Press, Cambridge (2000)
11. Gordon, M.: Twenty years of theorem proving for hols past, present and future. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.5170, pp. 1-5. Springer, Heidelberg (2008)
12. Hales, T.: Formal proof. Notices of the American Mathematical Society 55, 1370-1381 (2008)
13. Hales, T.C.: The Jordan curve theorem, formally and informally. The American Mathematical Monthly 114, 882-894 (2007)
14. Harrison, J.: A Short Survey of Automated Reasoning. In: Anai, H., Horimoto, K., Kutsia, T. (eds.) Ab 2007. LNCS, vol.4545, pp. 334-349. Springer, Heidelberg (2007)
15. Harrison, J.: Formalizing an analytic proof of the prime number theorem. J. Autom. Reasoning 43(3), 243-261 (2009)
16. Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (eds.): Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics, vol.133. Elsevier Science, Amsterdam (1994) ISBN-0444898220
17. Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27(2), 356-364 (1980)
18. Nieuwenhuis, R., Rubio, A.: Paramodulation-based thorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 471-1443 Elsevier and MIT Press (2001); ISBN-0-262-18223-8
19. Coen, C.S., Tassi, E.: A constructive and formal proof of Lebesgue's dominated convergence theorem in the interactive theorem prover Matita. Journal of Formalized Reasoning 1, 51-89 (2008)
20. van Benthem Jutting, J.: Checking Landau's "Grundlagen" in the Automath system. Mathematical centre tracts n. 83. Mathematisch Centrum, Amsterdam (1979)
21. Wiedijk, F.: The "De Bruijn factor" (2000), http://www.cs.ru.nl/∼freek/factor/
22. Wiedijk, F.: Estimating the cost of a standard library for a mathematical proof checker (2001), http://www.cs.ru.nl/∼freek/notes/mathstdlib2.pdf
23. Wiedijk, F.: A new implementation of Automath. Journal of Automated Reasoning 29, 365-387 (2002)