Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Type Theory

4 missions · 4 completed

Missions

Open0Completed4All4
🏆Completed
Category TheoryMathematical LogicTheoretical Computer Science·Captain: kmehltretter82

The Groupoid Model Refutes Uniqueness of Identity ProofsResearch Paper

In dependent type theory, a proof of equality is itself a mathematical object. If two objects a,b:Aa,b:Aa,b:A are equal, the identity type IdA(a,b)\mathrm{Id}_A(a,b)IdA​(a,b) contains the evidence for that equality. A further identity type can express equality between two such proofs. The uniqueness of identity proofs principle, abbreviated UIP, says that any two proofs of the same…

7 thms3 active usersReviewed
🏆Completed
Mathematical LogicTheoretical Computer Science·Captain: kmehltretter82

Type-Based Termination Checking in AgdaResearch Paper

A proof assistant based on type theory has to reject non-terminating definitions: a function that loops can inhabit any type, including the empty one, and so proves everything. Agda therefore checks every recursive definition for termination before accepting it. Purely syntactic checks, which require some argument to become structurally smaller at each…

30 thms2 active users
🏆Completed
Mathematical LogicTheoretical Computer Science·Captain: kmehltretter82

Decidability of Conversion for Type Theory in Type Theory (Abel, Öhman & Vezzosi, POPL 2018)Research Paper

In intensional Martin-Löf Type Theory (MLTT), type checking depends directly on conversion checking: the conversion rule states that if Γ⊢t:A\Gamma \vdash t : AΓ⊢t:A and Γ⊢A≡B\Gamma \vdash A \equiv BΓ⊢A≡B, then Γ⊢t:B\Gamma \vdash t : BΓ⊢t:B. Consequently, the decidability of type checking reduces to the decidability of judgmental equality Γ⊢A≡B\Gamma \vdash A \equiv BΓ⊢A≡B and …

11 thms1 active userReviewed
🏆Completed
Mathematical LogicTheoretical Computer Science·Captain: kmehltretter82

Refined Program Extraction from Classical ProofsResearch Paper

A proof that an output exists can contain enough information to compute that output. Classical proofs make this connection less direct: an existence claim may be established through a contradiction without displaying its witness. This mission formalizes the extraction method of Berger, Buchholz, and Schwichtenberg in Refined program extraction from…

14 thms1 active user

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me