Dependencies in Formal Mathematics: Applications and Extraction for Coq and Mizar

  • Jesse Alama
  • Lionel Mamane
  • Josef Urban
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7362)


Two methods for extracting detailed formal dependencies from the Coq and Mizar system are presented and compared. The methods are used for dependency extraction from two large mathematical repositories: the Coq Repository at Nijmegen and the Mizar Mathematical Library. Several applications of the detailed dependency analysis are described and proposed. Motivated by the different applications, we discuss the various kinds of dependencies that we are interested in, and the suitability of various dependency extraction methods.


Proof Assistant Proof Tree Formal Dependency Automate Theorem Prove Logical Construct 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adams, M.: Introducing HOL Zero. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 142–143. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Alama, J., Heskes, T., Kühlwein, D., Tsivtsivadze, E., Urban, J.: Premise selection for mathematics by corpus analysis and kernel methods. CoRR abs/1108.3446 (2012),
  3. 3.
    Alama, J., Kühlwein, D., Urban, J.: Automated and Human Proofs in General Mathematics: An Initial Comparison. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 37–45. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Asperti, A., Padovani, L., Coen, C.S., Guidi, F., Schena, I.: Mathematical knowledge management in HELM. Ann. Math. Artif. Intell. 38(1-3), 27–46 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Bertot, Y., Pons, O., Pottier, L.: Dependency graphs for interactive theorem provers. Tech. rep., INRIA, report RR-4052 (2000)Google Scholar
  6. 6.
    Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging Mathematical Structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 327–342. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Grabowski, A., Kornilowicz, A., Naumowicz, A.: mizar in a nutshell. Journal of Formalized Reasoning 3(2), 153–245 (2010)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Haftmann, F., Wenzel, M.: Constructive Type Classes in Isabelle. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 160–174. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Hoder, K., Voronkov, A.: Sine Qua Non for Large Theory Reasoning. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 299–314. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Mamane, L., Geuvers, H.: A document-oriented Coq plugin for TeXmacs. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds.) MKM 2007 - Work in Progress. RISC Report, vol. 07-06, pp. 47–60. University of Linz, Austria (2007)Google Scholar
  11. 11.
    Matuszewski, R., Rudnicki, P.: Mizar: the first 30 years. Mechanized Mathematics and Its Applications 4, 3–24 (2005)Google Scholar
  12. 12.
    Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Applied Logic 7(1), 41–57 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Pons, O., Bertot, Y., Rideau, L.: Notions of dependency in proof assistants. In: UITP 1998. Eindhoven University of Technology (1998)Google Scholar
  14. 14.
    Spitters, B., van der Weegen, E.: Type classes for mathematics in type theory. Mathematical Structures in Computer Science 21(4), 795–825 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Urban, J.: MoMM—fast interreduction and retrieval in large libraries of formalized mathematics. International Journal on Artificial Intelligence Tools 15(1), 109–130 (2006)CrossRefGoogle Scholar
  16. 16.
    Urban, J., Hoder, K., Voronkov, A.: Evaluation of Automated Theorem Proving on the Mizar Mathematical Library. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 155–166. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  17. 17.
    Wiedijk, F.: Mizar’s Soft Type System. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 383–399. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jesse Alama
    • 1
  • Lionel Mamane
    • 2
  • Josef Urban
    • 3
  1. 1.Center for Artificial IntelligenceNew University of LisbonPortugal
  2. 2.BereldangeLuxembourg
  3. 3.Institute for Computing and Information SciencesRadboud University NijmegenThe Netherlands

Personalised recommendations