The Matita interactive theorem prover

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

Volumn 6803 LNAI, Issue , 2011, Pages 64-69

  Asperti, Andrea ^a   Ricciotti, Wilmer ^a   Coen, Claudio Sacerdoti ^a   Tassi, Enrico ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT-BASED; EUROPEAN PROJECT; INNOVATIVE IDEAS; INTERACTIVE THEOREM PROVER; LIGHT WEIGHT; LOGICAL LEVELS; WHOLE SYSTEMS;

AUTOMATION;

USER INTERFACES;

EID: 80051694759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_7     Document Type: Conference Paper

References (29)

1. Asperti, A., Armentano, C.: A page in number theory. Journal of Formalized Reasoning 1, 1-23 (2008)
2. Asperti, A., Guidi, F., Coen, C.S., Tassi, E., Zacchiroli, S.: A content based mathematical search engine: Whelp. In: Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, pp. 17-32. Springer, Heidelberg (2006) (Pubitemid 43900641)
3. 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)
4. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., Tassi, E.: Hints in unification. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 84-98. Springer, Heidelberg (2009)
5. Asperti, A., Coen, C.S., Tassi, E., Zacchiroli, S.: User interaction with the Matita proof assistant. J. Autom. Reasoning 39(2), 109-139 (2007) (Pubitemid 47324833)
6. Asperti, A., Tassi, E.: An interactive driver for goal directed proof strategies. In: Proc. of UITP 2008. ENTCS, vol. 226, pp. 89-105 (2009)
7. Asperti, A., Tassi, E.: Smart matching. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) AISC 2010. LNCS, vol. 6167, pp. 263-277. Springer, Heidelberg (2010)
8. Asperti, A., Tassi, E.: Superposition as a logical glue. In: Proc. of TYPES 2009, EPTCS (2010) (to appear)
9. Aspinall, D.: Proof general: A generic tool for proof development. In: Graf, S. (ed.) TACAS 2000. LNCS, vol. 1785, p. 38. Springer, Heidelberg (2000)
10. Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Babu, C. S., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The POPLmark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 50-65. Springer, Heidelberg (2005) (Pubitemid 41450137)
11. Bertot, Y.: The CtCoq system: Design and architecture. Formal Aspects of Computing 11, 225-243 (1999) (Pubitemid 129607011)
12. The CerCo website, http://cerco.cs.unibo.it
13. Coen, C.S.: Declarative representation of proof terms. J. Autom. Reasoning 44(1-2), 25-52 (2010)
14. Hurd, J.: First-order proof tactics in higher-order logic theorem provers. Technical Report NASA/CP-2003-212448, Nasa technical reports (2003)
15. Korovin, K.: iProver - an instantiation-based theorem prover for first-order logic (System description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 292-298. Springer, Heidelberg (2008)
16. Luo, Z.: Coercive subtyping. J. Logic and Computation 9(1), 105-130 (1999)
17. McCune, W.,Wos, L.: Otter-the CADE-13 competition incarnations. J. of Autom. Reasoning 18(2), 211-220 (1997)
18. Meng, J., Quigley, C., Paulson, L.C.: Automation for interactive proof: First prototype. Inf. Comput. 204(10), 1575-1596 (2006) (Pubitemid 44345159)
19. The Mizar proof-assistant, http://mizar.uwb.edu.pl/
20. 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)
21. Sacerdoti Coen, C., Tassi, E.:Working with mathematical structures in type theory. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 157-172. Springer, Heidelberg (2008) (Pubitemid 351775489)
22. Coen, C.S., Tassi, E., Zacchiroli, S.: Tinycals: step by step tacticals. In: Proc. of UITP 2006. ENTCS, vol. 174, pp. 125-142. Elsevier Science, Amsterdam (2006) (Pubitemid 46702855)
23. Coen, C.S., Zacchiroli, S.: Efficient ambiguous parsing of mathematical formulae. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 347-362. Springer, Heidelberg (2004) (Pubitemid 39738977)
24. Sozeau, M.: Subset coercions in coq. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 237-252. Springer, Heidelberg (2007)
25. Sozeau, M., Oury, N.: First-class type classes. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278-293. Springer, Heidelberg (2008)
26. Sutcliffe, G.: The CADE-22 automated theorem proving system competition-CASC-22. AI Commun. 23, 47-59 (2010)
27. The Coq Development Team. The Coq proof assistant reference manual, http://coq.inria.fr/doc/main.html
28. Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 307-322. Springer, Heidelberg (1997) (Pubitemid 127112672)
29. Wenzel, M.T.: Isar-A generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167-184. Springer, Heidelberg (1999)