I am building a full-scale proof assistant for Computational Type Theory (CTT), called JonPRL. The goal is to create a proof assistant sufficient for developing Brouwerian mathematics, domain theory, synthetic topology and category theory.

I also spend a lot of my time working on educational materials on type theory and intuitionistic mathematics. Most recently, I have written a very detailed tutorial on Type Theory & its Meaning Explanations. Another example is Note on Diaconescu's Theorem, which was surprisingly well-regarded in the community.

If you find these materials useful, then I need your support to keep producing them. Thank you!

Jon Sterling is creating The JonPRL Proof Assistant

###### 0

patrons

###### $0

per monthI am building a full-scale proof assistant for Computational Type Theory (CTT), called JonPRL. The goal is to create a proof assistant sufficient for developing Brouwerian mathematics, domain theory, synthetic topology and category theory.

I also spend a lot of my time working on educational materials on type theory and intuitionistic mathematics. Most recently, I have written a very detailed tutorial on Type Theory & its Meaning Explanations. Another example is Note on Diaconescu's Theorem, which was surprisingly well-regarded in the community.

If you find these materials useful, then I need your support to keep producing them. Thank you!

I also spend a lot of my time working on educational materials on type theory and intuitionistic mathematics. Most recently, I have written a very detailed tutorial on Type Theory & its Meaning Explanations. Another example is Note on Diaconescu's Theorem, which was surprisingly well-regarded in the community.

If you find these materials useful, then I need your support to keep producing them. Thank you!