Otter - The CADE-13 Competition Incarnations
Journal of Automated Reasoning
Proof General: A Generic Tool for Proof Development
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
Tinycals: Step by Step Tacticals
Electronic Notes in Theoretical Computer Science (ENTCS)
User Interaction with the Matita Proof Assistant
Journal of Automated Reasoning
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
An Interactive Driver for Goal-directed Proof Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
About the Formalization of Some Results by Chebyshev in Number Theory
Types for Proofs and Programs
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Declarative Representation of Proof Terms
Journal of Automated Reasoning
The CADE-22 automated theorem proving system competition - CASC-22
AI Communications
Working with mathematical structures in type theory
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Mechanized metatheory for the masses: the PoplMark challenge
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A content based mathematical search engine: whelp
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Proof, message and certificate
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
The strategy challenge in SMT solving
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at http://matita.cs.unibo.it. The tool originated in the European project MoWGLI as a set of XML-based tools aimed to provide a mathematician-friendly web-interface to repositories of formal mathematical knoweldge, supporting advanced content-based functionalities for querying, searching and browsing the library. It has since then evolved into a fully fledged ITP, specifically designed as a light-weight, but competitive system, particularly suited for the assessment of innovative ideas, both at foundational and logical level. In this paper, we give an account of the whole system, its peculiarities and its main applications.