Matita

Matita declarations, each row carrying the statement and, where present, the proof.

Source

• Repository: https://github.com/LPCIC/matita
• Commit: 794ed25e6e608b2136ce7fa2963bca4115c7e175
• Files: 238
• License: other

Schema

Column	Type	Description
statement	string	Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof
proof	string	Verbatim proof/body, empty if the declaration has none
type	string	Declaration keyword
symbolic_name	string	Declaration identifier
library	string	Sub-library
filename	string	Repository-relative source path
imports	list[string]	File-level Require/Import modules
deps	list[string]	Intra-corpus identifiers referenced
docstring	string	Preceding documentation comment, empty if absent
source_url	string	Upstream repository
commit	string	Upstream commit extracted

Statistics

• Entries: 3,897
• With proof: 3,687 (94.6%)
• With docstring: 0 (0.0%)
• Libraries: 25

By type

Type	Count
lemma	1,624
definition	977
theorem	748
axiom	158
let rec	155
inductive	146
record	72
coercion	12
corollary	5

Example

f (n:nat) : nat
≝
 match n with
 [ O ⇒ O
 | S m ⇒ g m ]
and g (n:nat) : nat ≝
 match n with
 [ O ⇒ O
 | S m ⇒ f m ].

(*BUG: pattern matching patterns when arguments have been deleted from
  the constructor are wrong *)

coinductive stream: Type[0] ≝ scons : nat → stream → stream.

let corec div (n:nat) : stream ≝ scons n (div (S n)).

• type: let rec | symbolic_name: f | matita/matita/lib/extraction.ma

Use

Each declaration is split into a statement (signature/claim) and a proof (body) that are disjoint and together form the complete declaration, for proof modeling, autoformalization, retrieval, and dependency analysis via deps.

Citation

@misc{matita_dataset,
  title  = {Matita},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/LPCIC/matita, commit 794ed25e6e60},
  url    = {https://huggingface.co/datasets/phanerozoic/Matita}
}