An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]
☆111Feb 20, 2019Updated 7 years ago
Alternatives and similar repositories for JonPRL
Users that are interested in JonPRL are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated last month
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- The People's Refinement Logic☆229Jan 1, 2023Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Robots powered by Constructive Reals☆34Nov 3, 2017Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees