Matita is a new document-centric interactive theorem prover that - integrates several Mathematical Knowledge - Management tools and techniques.

- -

Matita is traditional. Its logical foundation is the - Calculus of (Co)Inductive Constructions (CIC). It can re-use - mathematical concepts produced by other proof assistants like - Coq and encoded in an - XML encoding of CIC. The interaction - paradigm of Matita is familiar, being inspired by CtCoq and - Proof General. Its - proof language is procedural in the same spirit of LCF.

+ Matita (that means pencil in italian) is an experimental, + interactive theorem prover under development at the + Computer Science Department of the + University of Bologna. +

Matita is innovative:

the user interface sports high quality bidimensional rendering of - proofs and formulae transformed on-the-fly to - MathML markup, on which direct - manipulation of the underlying CIC terms is still possible;

+ + + + + + + Matita is based on the + Calculus of (Co)Inductive Constructions, and is compatible, at some + extent, with Coq. + It is a reasonably small and simple application, whose + architectural and software complexity is meant to be mastered by + students, providing a tool particularly suited for testing innovative + ideas and solutions. + Matita adopts a tactic based editing mode; (XML-encoded) proof objects + are produced for storage and exchange. +

+ + + + + + + + + The graphical interface has been inspired by CtCoq and + Proof General. + It supports high quality bidimensional rendering of + proofs and formulae transformed on-the-fly to + MathML markup

the knowledge base is distributed: every authored concepts can be - published becoming part of the Matita library which can be browsed as - an hypertext (locally or on the World Wide Web) and searched by means - of content-based queries;

+ + + + + + + + + + + The knowledge base can be + browsed as an hypertext + (locally or on the World Wide Web) and + searched by means of + content-based queries;

the tactical language, part of the proof language, has +
+ + + + + + The tactical language, part of the proof language, has step-by-step semantics, enabling inspection and replaying of deeply - structured proof scripts.

+ structured proof scripts.