The Matita Interactive Theorem Prover

@inproceedings{Asperti2011TheMI,
  title={The Matita Interactive Theorem Prover},
  author={A. Asperti and W. Ricciotti and C. Coen and E. Tassi},
  booktitle={CADE},
  year={2011}
}
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… Expand
The Lean Theorem Prover (System Description)
Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims to bridge the gapExpand
Theorema 2.0: Computer-Assisted Natural-Style Mathematics
TLDR
The Theorema system is a computer implementation of the ideas behind the Theoremma, a computer assistant for the working mathematician that focuses on the natural style of system input, system output, system interaction and user interaction. Expand
A Survey of Interactive Theorem Proving
Fully formally verified mathematics and software are long-standing aims that became practically realizable with modern computer tools. Reasoning can be reduced to several basic logical principles,Expand
Elaboration in Dependent Type Theory
TLDR
An elaboration algorithm for dependent type theory that has been implemented in the Lean theorem prover is described, which supports higher-order unification, type class inference, ad hoc overloading, insertion of coercions, and the computational reduction of terms. Expand
Reverse Complexity
  • A. Asperti
  • Computer Science
  • Journal of Automated Reasoning
  • 2015
TLDR
The program is introduced and its methodology is illustrated through an investigation of the well known Hierarchy Theorems, to provide abstract, axiomatic characterizations of Complexity Classes with the purpose to better grasp their essence, identify their distinctive properties, suggest new, possibly non-standard computational models and finally provide new tools for separating them. Expand
Sharing a Library between Proof Assistants: Reaching out to the HOL Family
  • F. Thiré
  • Computer Science, Mathematics
  • LFMTP@FSCD
  • 2018
TLDR
This work studies the STTforall logic, an extension of Simple Type Theory that has been encoded in the logical framework Dedukti, and presents a translation from this logic to OpenTheory, a proof system and interoperability tool between provers of the HOL family. Expand
Natural Deduction Environment for Matita
TLDR
This work shows how to use Matita's features to obtain a simple learning environment for natural deduction, without modifying the source code or Matita. Expand
SMTCoq: Mixing Automatic and Interactive Proof Technologies
TLDR
SMTCoq is a plugin for the Coq interactive theorem prover to work in conjunction with automated theorem provers based on Boolean Satisfiability and SMT, in an efficient and expressive way to formally establish mathematical results relying on large combinatorial properties that require automatic Boolean reasoning. Expand
The Coq Library as a Theory Graph
TLDR
This work states that the representation of proof assistant libraries in a way that allows further processing in other systems is becoming increasingly important and that the complexities of logic, implementation, and library still make this very difficult. Expand
Recycling Proof Patterns in Coq: Case Studies
TLDR
Detailed case studies and evaluation of the machine-learning tool ML4PG built to interactively data-mine the electronic libraries of proofs, and to provide user guidance on the basis of proof patterns found in the existing libraries are provided. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Automation for interactive proof: First prototype
TLDR
A system in which Isabelle users obtain automatic support from automatic theorem provers such as Vampire and SPASS, and a working prototype that uses background processes already provides much of the desired functionality. Expand
An Interactive Driver for Goal-directed Proof Strategies
TLDR
This paper discusses the implementation of the resolution based automatic procedure of the Matita ITP, explicitly conceived to be interactively driven by the user through a suitable, simple graphical interface. Expand
User Interaction with the Matita Proof Assistant
TLDR
This paper focuses on some of the distinctive features of the user interaction with Matita, characterized mostly by the organization of the library as a searchable knowledge base, the emphasis on a high-quality notational rendering, and the complex interplay between syntax, presentation, and semantics. Expand
Automation for Interactive Proof
TLDR
This proposal involves adding first-order automation to the interactive theorem provers Isabelle and HOL, which have built two of the most important proof environments used today, namely HOL and Isabelle. Expand
A constructive and formal proof of Lebesgue's Dominated Convergence Theorem in the interactive theorem prover Matita
TLDR
A formalisation of a constructive proof of Lebesgue’s Dominated Convergence Theorem given by the Sacerdoti Coen and Zoli in [CSCZ] is presented and a new technique to cope with duality to halve the formalisation effort is introduced. Expand
Smart matching
TLDR
The paper describes the superpositionbased implementation of this feature inside the Matita interactive theorem prover, focusing in particular on the so called smart application tactic, supporting smart matching between a goal and a given result. Expand
Subset Coercions in Coq
TLDR
A new language for writing programs with dependent types on top of the COQ proof assistant allowing to write algorithms as easily as in a practical functional programming language whilst giving them as rich a specification as desired and proving that the code meets the specification using the whole COQProof apparatus. Expand
Mechanized Metatheory for the Masses: The PoplMark Challenge
TLDR
An initial set of benchmarks for measuring progress in this area of programming languages are proposed, based on the metatheory of System F<:, a typed lambda-calculus with second-order polymorphism, subtyping, and records. Expand
Proof General: A Generic Tool for Proof Development
TLDR
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant that provides a powerful user-interface with relatively little effort, alleviating the need for a proof assistant to provide its own GUI, and providing a uniform appearance for diverse proof assistants. Expand
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TLDR
Isar's main aspect is its formal language for natural deduction proofs, which sets out to bridge the semantic gap between internal notions of proof given by state-of-the-art interactive theorem proving systems and an appropriate level of abstraction for user-level work. Expand
...
1
2
3
4
...